2017/06/28 by Shaoshi Chen, Chen, Shaoshi
Computer Science · Engineering · Mathematics · #33F10 #Advanced Combinatorial Mathematics #Advanced Numerical Analysis Techniques #FOS: Computer and information sciences #I.1.2 #Polynomial and algebraic computation #Symbolic Computation (cs.SC) #acm:33F10 #cs.SC #msc:33F10
paper · pdf · doi:10.48550/arxiv.1706.09134
Dedicated to Professor Sergei A. Abramov on the occasion of his 70th birthday
arxiv created 2017/06/28 · openalex publication_date 2017/06/28 · arxiv updated 2017/06/29 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.