Work

Realizability of subgroups by subshifts of finite type

Year: 2025

Type: article

Abstract: We study the problem of realizing families of subgroups as the set of stabilizers of configurations from a subshift of finite type (SFT). This problem generalizes both the existence of strongly and weakly aperiodic SFTs. We show that a finitely generated normal subgroup is realizable if and only if the quotient by the subgroup admits a strongly aperiodic SFT. We also show that if a subgroup is realizable, its subgroup membership problem must be decidable. The article also contains the introduction of periodically rigid groups, which are groups for which every weakly aperiodic SFT is strongly aperiodic. We conjecture that the only finitely generated periodically rigid groups are virtually \mathbb{Z} groups and torsion-free virtually \mathbb{Z}^{2} groups. Finally, we show virtually nilpotent and polycyclic groups satisfy the conjecture.

Source: Groups Geometry and Dynamics

DOI: 10.4171/ggd/900

Author: Nicolás Bitar

Institution: Université de Picardie Jules Verne

Language: English

Topic: semigroups and automata theory

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

Funder: Agence Nationale de la Recherche

Award: Inside zero entropy systems