Graph subshifts of finite type are defined via forbidden local patterns; those with only infinite graphs are either aperiodic or their period groups are not residually finite.
When periodicities enforce aperiodicity
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Aperiodic tilings are non-periodic tilings defined by local rules. They are widely used to model quasicrystals, and a central question is to understand which of the non-periodic tilings are actually aperiodic. Among tilings, those by rhombi can be easily seen as approximations of surfaces in higher dimensional spaces. In particular, those which approximate irrational planes are non-periodic. But which ones are also aperiodic? This paper introduces the notion of subperiod, which links algebraic properties of a plane with geometric properties of the tilings that approximate it. A necessary and sufficient condition is obtained for tilings that can be seen in the four dimensional Euclidean space. This result is then applied to some examples in higher codimensions, notably tilings with n-fold rotational symmetry.
fields
cs.DM 1years
2023 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Graph subshifts
Graph subshifts of finite type are defined via forbidden local patterns; those with only infinite graphs are either aperiodic or their period groups are not residually finite.