SearcharxivSearch

arXiv · 1710.03707

Lamplighters admit weakly aperiodic SFTs

Abstract

Let $A$ be a finite set and $G$ a group. A closed subset $X$ of $A^G$ is called a subshift if the action of $G$ on $A^G$ preserves $X$. If $K$ is a closed subset of $A^G$ such that membership in $K$ is determined by looking at a fixed finite set of coordinates, and $X$ is the intersection of all translates of $K$ under the action of $G$, then $X$ is called a subshift of finite type (SFT). If an SFT is nonempty and contains no finite $G$-orbits, it is said to be weakly aperiodic. A virtually cyclic group has no weakly aperiodic SFT, and Carroll and Penland have conjectured that a group with no weakly aperiodic SFT must be virtually cyclic. Answering a question of Jeandel, we show that lamplighters always admit weakly aperiodic SFTs.

Explore related subjects

Keep this discovery

BibTeXRIS

David Bruce Cohen. 2017-10-10. Lamplighters admit weakly aperiodic SFTs. https://arxiv.org/abs/1710.03707

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