arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1605.05929cs.DMmath.CO
收藏

Nivat猜想的代数几何方法

An Algebraic Geometric Approach to Nivat's Conjecture

Jarkko Kari, Michal Szabados

摘要:

我们研究多维配置(无限的话)和子转移的低模式复杂性使用代数几何工具。我们表示的配置作为一个多变量的正式幂级数整数和调查的设置时,有一个非平凡的零化多项式:一个非零多项式的正式产品与幂级数为零。这种零化子存在,例如,如果在配置中的一些有限形状$D$的不同图案的数量至多是形状的大小$|D|$。这是我们的低模式复杂度假设。我们证明了配置必须是整数上的周期配置之和,可能具有无界值。作为该方法的一个具体应用,我们得到了一个渐近版本的著名Nivat的猜想:我们证明,任何二维的,非周期性的配置可以满足低图案复杂性的假设,相对于只有100多个不同的矩形形状$D$。

英文摘要:

We study multidimensional configurations (infinite words) and subshifts of low pattern complexity using tools of algebraic geometry. We express the configuration as a multivariate formal power series over integers and investigate the setup when there is a non-trivial annihilating polynomial: a non-zero polynomial whose formal product with the power series is zero. Such annihilator exists, for example, if the number of distinct patterns of some finite shape $D$ in the configuration is at most the size $|D|$ of the shape. This is our low pattern complexity assumption. We prove that the configuration must be a sum of periodic configurations over integers, possibly with unbounded values. As a specific application of the method we obtain an asymptotic version of the well-known Nivat's conjecture: we prove that any two-dimensional, non-periodic configuration can satisfy the low pattern complexity assumption with respect to only finitely many distinct rectangular shapes $D$.

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

↑