An Algorithmic Approach to the $q$-Summability Problem of Bivariate Rational Functions
Rong-Hua Wang

TL;DR
This paper extends previous work on summability of bivariate rational functions by developing a simplified algorithm for the $q$-case, enhancing computational methods in this area.
Contribution
The paper introduces a simplified and adapted algorithm for the $q$-summability problem of bivariate rational functions, building on prior solutions.
Findings
Developed a simplified algorithm for $q$-summability.
Extended previous summability algorithms to the $q$-case.
Enhanced computational efficiency for summability problems.
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 -case.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPolynomial and algebraic computation · Advanced Numerical Analysis Techniques · Mathematical functions and polynomials
