SearcharxivSearch

arXiv · 1707.00215

Automaton groups and complete square complexes

Abstract

The first example of a non-residually finite group in the classes of finitely presented small-cancelation groups, automatic groups, and CAT(0) groups was constructed by Wise as the fundamental group of a complete square complex (CSC for short) with twelve squares. At the same time, Janzen and Wise proved that CSCs with at most three squares, five or seven squares have residually finite fundamental group. The smallest open cases were CSCs with four squares and directed complete VH complexes with six squares. We prove that the CSC with four squares studied by Janzen and Wise has a non-residually finite fundamental group. In particular, this gives a non-residually finite CAT(0) group isometric to $F_2\times F_2$. For the class of complete directed VH complexes, we prove that there are exactly two complexes with six squares having a non-residually finite fundamental group. In particular, this positively answers to a question of Wise on whether the main example from his PhD thesis is non-residually finite. As a by-product, we get finitely presented torsion-free simple groups which decompose into an amalgamated free product of free groups $F_7*_{F_{49}}F_7$. Our approach relies on the connection between square complexes and automata discovered by Glasner and Mozes, where complete VH complexes with one vertex correspond to bireversible automata. We prove that the square complex associated to a bireversible automaton with two states or over the binary alphabet generating an infinite automaton group has a non-residually finite fundamental group. We describe automaton groups associated to CSCs with four squares and get two simple automaton representations of the free group $F_2$ and the first automaton representation of the free product $C_3*C_3$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ievgen Bondarenko, Bohdan Kivva. 2017-07-01. Automaton groups and complete square complexes. https://arxiv.org/abs/1707.00215

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