SearcharxivSearch

arXiv · 2204.00415

Gate lattices and the stabilized automorphism group

Abstract

We study the stabilized automorphism group of a subshift of finite type with a certain gluing property called the eventual filling property, on a residually finite group $G$. We show that the stabilized automorphism group is simply monolithic, i.e. it has a unique minimal non-trivial normal subgroup -- the monolith -- which is additionally simple. To describe the monolith, we introduce gate lattices, which apply (reversible logical) gates on finite-index subgroups of $G$. The monolith is then precisely the commutator subgroup of the group generated by gate lattices. If the subshift and the group $G$ have some additional properties, then the gate lattices generate a perfect group, thus they generate the monolith. In particular, this is always the case when the acting group is the integers. In this case we can also show that gate lattices generate the inert part of the stabilized automorphism group. Thus we obtain that the stabilized inert automorphism group of a one-dimensional mixing subshift of finite type is simple.

Explore related subjects

Keep this discovery

BibTeXRIS

Ville Salo. 2022-04-01. Gate lattices and the stabilized automorphism group. https://arxiv.org/abs/2204.00415

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR