Friday, June 18, 2010 - 15:05
1 hour (actually 50 minutes)
In this talk we recall some modular techniques (chinese remaindering,rational reconstruction, etc.) that play a crucial role in manycomputer algebra applications, e.g., for solving linear systems over arational function field, for evaluating determinants symbolically,or for obtaining results by ansatz ("guessing"). We then discuss howmuch our recent achievements in the areas of symbolic summation andintegration and combinatorics benefited from these techniques.