Abstract
AbstractA d-dimensional configuration $$c:\mathbb {Z}^d\longrightarrow A$$
c
:
Z
d
⟶
A
is a coloring of the d-dimensional infinite grid by elements of a finite alphabet $$A\subseteq \mathbb {Z}$$
A
⊆
Z
. The configuration c has an annihilator if a non-trivial linear combination of finitely many translations of c is the zero configuration. Writing c as a d-variate formal power series, the annihilator is conveniently expressed as a d-variate Laurent polynomial f whose formal product with c is the zero power series. More generally, if the formal product is a strongly periodic configuration, we call the polynomial f a periodizer of c. A common annihilator (periodizer) of a set of configurations is called an annihilator (periodizer, respectively) of the set. In particular, we consider annihilators and periodizers of d-dimensional subshifts, that is, sets of configurations defined by disallowing some local patterns. We show that a $$(d-1)$$
(
d
-
1
)
-dimensional linear subspace $$S\subseteq \mathbb {R}^d$$
S
⊆
R
d
is expansive for a subshift if the subshift has a periodizer whose support contains exactly one element of S. As a subshift is known to be finite if all $$(d-1)$$
(
d
-
1
)
-dimensional subspaces are expansive, we obtain a simple necessary condition on the periodizers that guarantees finiteness of a subshift or, equivalently, strong periodicity of a configuration. We provide examples in terms of tilings of $$\mathbb {Z}^d$$
Z
d
by translations of a single tile.
Funder
University of Turku (UTU) including Turku University Central Hospital
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference16 articles.
1. Kari, J., Szabados, M.: An Algebraic Geometric Approach to Nivat’s Conjecture. In: Proceedings of ICALP 2015, part II. vol. 9135 of Lecture Notes in Computer Science p. 273–285, (2015)
2. Nivat, M.: Invited talk at the 24th International Colloquium on Automata, Languages, and Programming (ICALP 1997)
3. Greenfeld, R., Tao, T.: A counterexample to the periodic tiling conjecture. arXiv:2211.15847
4. Heikkilä, E., Herva, P., Kari, J.: On Perfect Coverings of Two-Dimensional Grids. In: Diekert V, Volkov MV, editors. Developments in Language Theory -26th International Conference, DLT 2022, Tampa, FL, USA, May 9-13, 2022, Proceedings. vol. 13257 of Lecture Notes in Computer Science. Springer; p. 152–163 (2022)
5. Kari, J., Szabados, M.: An algebraic geometric approach to Nivat’s conjecture. Information and Computation. 271, 104481 (2020)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. On Forced Periodicity of Perfect Colorings;Theory of Computing Systems;2023-06-28