A direct algorithm to construct the minimal \(Z\)-pairs for rational functions.

DOI10.1016/S0196-8858(02)00529-8zbMath1048.65026OpenAlexW1980283844MaRDI QIDQ1398291

D. Massart

Publication date: 29 July 2003

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0196-8858(02)00529-8

zbMATH Keywords

algorithmsrational functionsMaple implementation\(Z\)-pairstiming comparisons

Mathematics Subject Classification ID

Approximation by rational functions (41A20) Computation of special functions and constants, construction of tables (65D20)

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, Ore polynomial rings in one variable in computer algebra.

Uses Software

• Maple
• HypergeometricSum

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An algorithmic proof theory for hypergeometric (ordinary and ``\(q\)) multisum/integral identities
• The method of creative telescoping
• On Zeilberger's algorithm and its \(q\)-analogue
• A criterion for the applicability of Zeilberger's algorithm to rational functions
• Greatest factorial factorization and symbolic summation
• Rational summation and Gosper-Petkovšek representation
• A \textit{Mathematica} version of Zeilberger's algorithm for proving binomial coefficient identities
• Minimal decomposition of indefinite hypergeometric sums
• On the \(q\)-analogue of Zeilberger's algorithm to rational functions