有理多边形集平移铺砌的周期性与可判定性
Periodicity and decidability of translational tilings by rational polygonal sets
AI总结:
本文研究了 $\mathbb R^2$ 中多边形集的周期性铺砌猜想,证明了顶点为有理数的多边形铺块满足该猜想,得出其铺砌具有可判定性,且任意平移铺砌均为弱周期性。
摘要:
周期性铺砌猜想断言,若区域 $Σ\subset \mathbb R^d$ 通过平移铺砌 $\mathbb R^d$,则其至少存在一种完全周期性的铺砌。该猜想已知在 $\mathbb R$ 中成立,且近期在充分高维空间中被证伪。本文研究多边形集的周期性铺砌猜想,多边形集是指 $\mathbb R^2$ 中边界为有限条线段并集的有界开集。我们证明了对于任意顶点为有理数的多边形铺块,周期性铺砌猜想均成立。作为论证的推论,我们还得出了有理多边形集铺砌的可判定性。此外,我们证明了由有理多边形铺块构成的任意平移铺砌都是弱周期性的,即它可被划分为有限个单周期部分。
英文摘要:
The periodic tiling conjecture asserts that if a region $Σ\subset \mathbb R^d$ tiles $\mathbb R^d$ by translations then it admits at least one fully periodic tiling. This conjecture is known to hold in $\mathbb R$, and recently it was disproved in sufficiently high dimensions. In this paper, we study the periodic tiling conjecture for polygonal sets: bounded open sets in $\mathbb R^2$ whose boundary is a finite union of line segments. We prove the periodic tiling conjecture for any polygonal tile whose vertices are rational. As a corollary of our argument, we also obtain the decidability of tilings by rational polygonal sets. Moreover, we prove that any translational tiling by a rational polygonal tile is weakly-periodic, i.e., can be partitioned into finitely many singly-periodic pieces.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。