Shiftless decomposition and polynomial-time rational summation

  • Authors:

  • J. Gerhard;M. Giesbrecht;A. Storjohann;E. V. Zima

  • Affiliations:

  • Maplesoft, Waterloo, ON, Canada;University of Waterloo, Waterloo, ON, Canada;University of Waterloo, Waterloo, ON, Canada;University of Waterloo, Waterloo, ON, Canada

  • Venue:
  • ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

New algorithms are presented for computing the dispersion set of two polynomials over Q and for shiftless factorization. Together with a summability criterion by Abramov, these are applied to get a polynomial-time algorithm for indefinite rational summation, using a sparse representation of the output.