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

线性差分系统的超几何解

Hypergeometric Solutions of Linear Difference Systems

Moulay Barkatou, Mark van Hoeij, Johannes Middeke, Yi Zhou

AI总结:

本研究将Petkovšek算法推广到线性差分系统的超几何解求解,通过超约简算法等方法缩减候选集,已在Maple实现且可处理高维系统,助力算子因式分解。

摘要:

我们将用于计算标量差分方程超几何解的Petkovšek算法推广到差分系统$τ(Y) = M Y$的情形,其中$M \rm GL_n(C(x))$,$τ$为移位算子。超几何解是形如$γP$的解,其中$P \n C(x)^n$,$γ$是$C(x)$上的超几何项,即${τ(γ)}/γ \rm C(x)$。我们的贡献涉及高效计算${τ(γ)}/γ$的候选集,我们将其写为$λ= c\frac{A}{B}$,其中首一多项式$A, B \rm C[x]$,$c \rm C^*$。$M^{-1}$和$M$的分母因子给出$A$和$B$的候选,而$c$的候选需要另一种算法。我们使用超约简算法计算$c$的候选,并借助其他要素缩减$A/B$的候选列表。为进一步减少$A/B$的候选数量,我们通过界定局部类型来界定所谓的$A/B$的类型。我们的算法已在Maple中实现,实验表明该实现可处理高维系统,这对算子因式分解很有用。

英文摘要:

We extend Petkovšek's algorithm for computing hypergeometric solutions of scalar difference equations to the case of difference systems $τ(Y) = M Y$, with $M \in {\rm GL}_n(C(x))$, where $τ$ is the shift operator. Hypergeometric solutions are solutions of the form $γP$ where $P \in C(x)^n$ and $γ$ is a hypergeometric term over $C(x)$, i.e. ${τ(γ)}/γ \in C(x)$. Our contributions concern efficient computation of a set of candidates for ${τ(γ)}/γ$ which we write as $λ= c\frac{A}{B}$ with monic $A, B \in C[x]$, $c \in C^*$. Factors of the denominators of $M^{-1}$ and $M$ give candidates for $A$ and $B$, while another algorithm is needed for $c$. We use the super-reduction algorithm to compute candidates for $c$, as well as other ingredients to reduce the list of candidates for $A/B$. To further reduce the number of candidates $A/B$, we bound the so-called type of $A/B$ by bounding local types. Our algorithm has been implemented in Maple and experiments show that our implementation can handle systems of high dimension, which is useful for factoring operators.

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

↑