On the structure of solutions to the key Gosper equation in problems of symbolic summation

DOI10.1134/s0965542523010153OpenAlexW4362725652MaRDI QIDQ6039135

Eugene Zima

Publication date: 3 May 2023

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0965542523010153

zbMATH Keywords

factorial polynomialspolynomial normal formsindefinite hypergeometric summationaccelerated Gosper's algorithm

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Polynomials in real and complex fields: factorization (12D05) Algorithms for approximation of functions (65D15) Symbolic computation of special functions (Gosper and Zeilberger algorithms, etc.) (33F10)

Cites Work

• Rational normal forms and minimal decompositions of hypergeometric terms
• Hypergeometric solutions of linear recurrences with polynomial coefficients
• Improvement of the degree setting in Gosper's algorithm
• Rational summation and Gosper-Petkovšek representation
• Decision procedure for indefinite hypergeometric summation
• Accelerating indefinite hypergeometric summation algorithms
• On the summation of rational functions

This page was built for publication: On the structure of solutions to the key Gosper equation in problems of symbolic summation