科研进展
通过整基来设计多项式递归序列的基于约化巧构邻差算法(陈绍示与合作者)
发布时间:2024-10-24 |来源:

We propose a way to split a given bivariate P -recursive sequence into a summable part and a non-summable part in such a way that the non-summable part is minimal in some sense. This decomposition gives rise to a new reduction -based creative telescoping algorithm based on the concept of integral bases. (c) 2024 Elsevier Ltd. This is an open access article under the CC BY license (http://creativecommons .org /licenses /by /4 .0/).

Publication:

Journal of Symbolic Computation Volume 126, January–February 2025

https://doi.org/10.1016/j.jsc.2024.102341

Author:

Shaoshi Chen

KLMM, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, 100190, China

School of Mathematical Sciences, University of Chinese Academy of Sciences, Beijing, 100049, China

Email: schen@amss.ac.cn

Lixin Du

Institute for Algebra, Johannes Kepler University, Linz, A4040, Austria

Email: lixindumath@gmail.com

Manuel Kauers

Institute for Algebra, Johannes Kepler University, Linz, A4040, Austria

Email: manuel.kauers@jku.at

Rong-Hua Wang

School of Mathematical Sciences, Tiangong University, Tianjin, 300387, China

Email: wangronghua@tiangong.edu.cn



附件下载:

    联系我们
    参考
    相关文章