Minimal decomposition of indefinite hypergeometric sums

DOI10.1145/384101.384103zbMath1356.33012OpenAlexW2069101812MaRDI QIDQ2958906

Marko Petkovsek, Sergey A. Abramov

Publication date: 3 February 2017

Published in: Proceedings of the 2001 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/384101.384103

Mathematics Subject Classification ID

Symbolic computation of special functions (Gosper and Zeilberger algorithms, etc.) (33F10) Hypergeometric functions (33C99)

Related Items

Efficient rational creative telescoping, Telescoping in the context of symbolic summation in Maple, Constructing minimal telescopers for rational functions in three discrete variables, A direct algorithm to construct the minimal \(Z\)-pairs for rational functions., Polynomial reduction for holonomic sequences and applications in \(\pi\)-series and congruences, When does Zeilberger's algorithm succeed?, Polynomial reduction and supercongruences, On the existence of telescopers for mixed hypergeometric terms, On the order of the recurrence produced by the method of creative telescoping, \(q\)-rational reduction and \(q\)-analogues of series for \(\pi\)