arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1909.03239math.AGmath.DS
收藏

序列求解差分方程:普适性与不可判定性

Solving difference equations in sequences: Universality and Undecidability

Gleb Pogudin, Thomas Scanlon, Michael Wibmer

摘要:

$ $我们研究解决方案的差分方程的环序列,更一般地说,解决方案的方程与一个幺半群行动的环序列索引的幺半群。该框架包括例如网格上的差分方程(例如,标准差分格式)和字上函数中的差分方程。在普适性方面,我们证明了在基域的基数大于幺半群的基数的假设下,这类差分方程的一个强零点定理,并构造了一个例子说明这个假设不能省略.在不可判定性方面,我们证明了以下问题是不可判定的:$\bullet$检验根式差分理想隶属度或等价地判定给定差分多项式在给定差分多项式组的解集上是否为零,$\bullet$判定实值序列环上差分方程组的相容性; $\bullet$确定一个方程组的一致性与作用的$\mathbb{Z}^2$,$\mathbb{N}^2$,或自由幺半群与两个生成元在相应的环序列在任何领域的特征零。

英文摘要:

$ $We study solutions of difference equations in the rings of sequences and, more generally, solutions of equations with a monoid action in the ring of sequences indexed by the monoid. This framework includes, for example, difference equations on grids (e.g., standard difference schemes) and difference equations in functions on words. On the universality side, we prove a version of strong Nullstellensatz for such difference equations under the assuption that the cardinality of the ground field is greater than the cardinality of the monoid and construct an example showing that this assumption cannot be omitted. On the undecidability side, we show that the following problems are undecidable: $\bullet$ testing radical difference ideal membership or, equivalently, determining whether a given difference polynomial vanishes on the solution set of a given system of difference polynomials; $\bullet$ determining consistency of a system of difference equations in the ring of real-valued sequences; $\bullet$ determining consistency of a system of equations with action of $\mathbb{Z}^2$, $\mathbb{N}^2$, or the free monoid with two generators in the corresponding ring of sequences over any field of characteristic zero.

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

↑