arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1706.09134cs.SC
收藏

有理求和Abramov算法的二元推广

Bivariate Extensions of Abramov's Algorithm for Rational Summation

Shaoshi Chen

摘要:

阿布拉莫夫算法使我们能够决定一个单变量有理函数是否可以写成另一个有理函数的差,这是有理求和的基本算法。在2014年,Chen和Singer将Abramov的算法推广到两个($q$ -)离散变量的有理函数的情况。在本文中,我们解决了其余三个混合的情况下,完成我们最近的项目对二元扩展的阿布拉莫夫算法的有理求和。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑