An algorithmic approach to the \(q\)-summability problem of bivariate rational functions

DOI10.1007/s11424-020-9391-6zbMath1462.33012arXiv1911.04725OpenAlexW3086480703MaRDI QIDQ2661863

Rong-Hua Wang

Publication date: 8 April 2021

Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1911.04725

zbMATH Keywords

Gosper's algorithm\(q\)-summabilitypolynomial residues

Mathematics Subject Classification ID

Difference equations, scaling ((q)-differences) (39A13) General theorems on summability (40D05) Numerical approximation and evaluation of special functions (33F05)

Related Items

Foreword to the special topic

Uses Software

• SIGMA
• MultiZeilberger

Cites Work

• On the summability of bivariate rational functions
• A fast approach to creative telescoping
• Multi-variable Zeilberger and Almkvist-Zeilberger algorithms and the sharpening of Wilf-Zeilberger theory
• A fast algorithm for proving terminating hypergeometric identities
• Theory of summation in finite terms
• The method of creative telescoping
• Bivariate extensions of Abramov's algorithm for rational summation
• The Ore-Sato theorem and shift exponents in the \(q\)-difference case
• An algorithm for deciding the summability of bivariate rational functions
• Some open problems related to creative telescoping
• A new Sigma approach to multi-summation
• A telescoping method for double summations
• A Modified Abramov-Petkovsek Reduction and Creative Telescoping for Hypergeometric Terms
• Existence Problem of Telescopers
• Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
• Summation in Finite Terms
• Decision procedure for indefinite hypergeometric summation
• Integration of solutions of linear functional equations
• Existence Problem of Telescopers for Rational Functions in Three Variables
• Unnamed Item
• Unnamed Item
• Unnamed Item