An Algorithmic Approach to the q-Summability Problem of Bivariate Rational Functions

2019/11/12 by Rong-Hua Wang, Wang, Rong-Hua · 1 citation
Computer Science · Engineering · Mathematics · #Advanced Numerical Analysis Techniques #Algebra over a field #Applied mathematics #Bivariate analysis #Calculus (dental) #Chen #Combinatorics (math.CO) #Discrete mathematics #FOS: Mathematics #Mathematical functions and polynomials #Mathematics #Polynomial and algebraic computation #Pure mathematics #Rational function #Statistics #math.CO

paper · pdf · doi:10.48550/arxiv.1911.04725

arxiv created 2019/11/12 · openalex publication_date 2019/11/12 · arxiv updated 2019/11/13 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In 2014, Chen and Singer solved the summability problem of bivariate rational functions. Later an algorithmic proof was presented by Hou and the author. In this paper, the algorithm will be simplified and adapted to the q-case.

Cited by

• On the Summability Problem of Multivariate Rational Functions in the Mixed Case

Related

• On the Summability of Bivariate Rational Functions
• Bivariate Extensions of Abramov's Algorithm for Rational Summation
• An Algorithm for Deciding the Summability of Bivariate Rational Functions
• On the Summability Problem of Multivariate Rational Functions in the Mixed Case
• Applicability of the q-Analogue of Zeilberger's Algorithm