Bivariate extensions of Abramov's algorithm for rational summation

DOI10.1007/978-3-319-73232-9_4MaRDI QIDQ1716148zbMATH OpenOpenAlexFDO

Authors Shaoshi Chen

Publication date 29 January 2019

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

zbMATH Keywords

Abramov's algorithmdiscrete residuesOstrogradsky-Hermite reductionsymbolic integrationsymbolic summation

Mathematics Subject Classification ID

Approximation to limiting values (summation of series, etc.) (40A25) Symbolic computation and algebraic computation (68W30)

Abstract: Abramov's algorithm enables us to decide whether a univariate rational function can be written as a difference of another rational function, which has been a fundamental algorithm for rational summation. In 2014, Chen and Singer generalized Abramov's algorithm to the case of rational functions in two ($q$-)discrete variables. In this paper we solve the remaining three mixed cases, which completes our recent project on bivariate extensions of Abramov's algorithm for rational summation.

Recommendations

• An algorithm for deciding the summability of bivariate rational functions
• On the rational summation problem
• Rational summation of rational functions
• A note on the minimality problem in indefinite summation of rational functions
• An algorithmic approach to the q-summability problem of bivariate rational functions

Cited in

(5)

• On the existence of telescopers for rational functions in three variables
• An algorithm for deciding the summability of bivariate rational functions
• An algorithmic approach to the q-summability problem of bivariate rational functions
• A note on the minimality problem in indefinite summation of rational functions
• Twisted Mahler discrete residues

This page was built for publication: Bivariate extensions of Abramov's algorithm for rational summation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1716148)