Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1412.4572

The large scale geometry of strongly aperiodic subshifts of finite type

David Bruce Cohen
View original source ↗Read source document ↗Export metadata ↓

Abstract

A subshift on a group G is a closed, G-invariant subset of A^G, for some finite set A. It is said to be a subshift of finite type (SFT) if it is defined by a finite collection of 'forbidden patterns', to be strongly aperiodic if all point stabilizers are trivial, and weakly aperiodic if all point stabilizers are infinite index in G. We show that groups with at least 2 ends have a strongly aperiodic SFT, and that having such an SFT is a QI invariant for finitely presented torsion free groups. We show that a finitely presented torsion free group with no weakly aperiodic SFT must be QI-rigid. The domino problem on G asks whether the SFT specified by a given set of forbidden patterns is empty. We show that decidability of the domino problem is a QI invariant.

Explore related subjects

math.GR

Keep this discovery

BibTeXRIS

David Bruce Cohen. 2014-12-15. The large scale geometry of strongly aperiodic subshifts of finite type. https://arxiv.org/abs/1412.4572

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗