Search arXivSearch

arXiv · 2202.00212

Strongly aperiodic SFTs on hyperbolic groups: where to find them and why we love them

Abstract

D. B. Cohen, C. Goodman-Strauss, and the author proved that a hyperbolic group admits an "SA SFT" if and only if it has at most one end. This paper has two distinct parts: the first is a conversation explaining what an SA SFT is and how they may be of use. In the second part I attempt to explain both old and new ideas that go into the proof. References to specific claims in the original paper are given, with the hope that any interested reader may be able to find the details there more accessible after reading this exposition.

Explore related subjects

Keep this discovery

BibTeXRIS

Yo'av Rieck. 2022-02-01. Strongly aperiodic SFTs on hyperbolic groups: where to find them and why we love them. https://arxiv.org/abs/2202.00212

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