Bivariate Extensions of Abramov's Algorithm for Rational Summation
Symbolic Computation
2017-06-29 v1
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 (-)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.
Keywords
Cite
@article{arxiv.1706.09134,
title = {Bivariate Extensions of Abramov's Algorithm for Rational Summation},
author = {Shaoshi Chen},
journal= {arXiv preprint arXiv:1706.09134},
year = {2017}
}
Comments
Dedicated to Professor Sergei A. Abramov on the occasion of his 70th birthday