Abstract
The greatest factorial factorization (GFF) of a polynomial provides an analogue to square-free factorization but with respect to integer shifts instead to multiplicities. We illustrate the fundamental role of that concept in the context of symbolic summation. Besides a detailed discussion of the basic GFF notions we present a new approach to the indefinite rational summation problem as well as to Gosper's algorithm for summing hypergeometric sequences.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have