A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä

Expansivity and Periodicity in Algebraic Subshifts




TekijätKari Jarkko

KustantajaSPRINGER

Julkaisuvuosi2023

JournalTheory of Computing Systems

Tietokannassa oleva lehden nimiTHEORY OF COMPUTING SYSTEMS

Lehden akronyymiTHEOR COMPUT SYST

Sivujen määrä19

ISSN1432-4350

eISSN1433-0490

DOIhttps://doi.org/10.1007/s00224-023-10139-7

Verkko-osoitehttps://link.springer.com/article/10.1007/s00224-023-10139-7

Rinnakkaistallenteen osoitehttps://research.utu.fi/converis/portal/detail/Publication/180640594


Tiivistelmä

A d-dimensional configuration c : Zd −→ A is a coloring of the d-dimensional infinite grid by elements of a finite alphabet 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)-dimensional linear subspace S ⊆ Rd 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)-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 Zd by translations of a single tile.

Keywords Symbolic dynamics · Annihilator · Periodicity · Expansivity · Golomb-Welch conjecture · Periodic tiling problem


Ladattava julkaisu

This is an electronic reprint of the original article.
This reprint may differ from the original in pagination and typographic detail. Please cite the original version.





Last updated on 2024-26-11 at 20:52