arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2402.07328cs.SCmath.ACmath.CO
收藏

有理函数离散留数的计算

Computing discrete residues of rational functions

Carlos E. Arreche, Hari P. Sitaula

AI总结:

针对有理函数离散留数直接计算因分母完全因式分解复杂度高而不现实的问题,提出仅依赖gcd计算和线性代数的无因式分解算法,可用于可和性判定、创造性伸缩等多个领域。

摘要:

2012年,Chen和Singer提出了有理函数离散留数的概念,将其作为有理可和性的完全障碍。更明确地说,对于给定的有理函数f(x),存在有理函数g(x)使得f(x)=g(x+1)-g(x),当且仅当f(x)的所有离散留数均为零。除可和性之外,离散留数还有许多重要的进一步应用:用于创造性伸缩问题,进而确定超几何序列之间的(微分-)代数关系,随后用于计算差分方程的(微分)Galois群。然而,有理函数的离散留数是通过其完全部分分式分解来定义的,由于将任意分母多项式完全分解为一次因子的复杂度很高,直接计算离散留数并不现实。我们提出了一种无需因式分解的算法来计算有理函数的离散留数,该算法仅依赖最大公因子(gcd)计算和线性代数。

英文摘要:

In 2012 Chen and Singer introduced the notion of discrete residues for rational functions as a complete obstruction to rational summability. More explicitly, for a given rational function f(x), there exists a rational function g(x) such that f(x) = g(x+1) - g(x) if and only if every discrete residue of f(x) is zero. Discrete residues have many important further applications beyond summability: to creative telescoping problems, thence to the determination of (differential-)algebraic relations among hypergeometric sequences, and subsequently to the computation of (differential) Galois groups of difference equations. However, the discrete residues of a rational function are defined in terms of its complete partial fraction decomposition, which makes their direct computation impractical due to the high complexity of completely factoring arbitrary denominator polynomials into linear factors. We develop a factorization-free algorithm to compute discrete residues of rational functions, relying only on gcd computations and linear algebra.

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

↑