SearcharxivSearch

arXiv · 1712.01091

New simple lattices in products of trees and their projections

Abstract

Let $\Gamma \leq \mathrm{Aut}(T_{d_1}) \times \mathrm{Aut}(T_{d_2})$ be a group acting freely and transitively on the product of two regular trees of degree $d_1$ and $d_2$. We develop an algorithm which computes the closure of the projection of $\Gamma$ on $\mathrm{Aut}(T_{d_t})$ under the hypothesis that $d_t \geq 6$ is even and that the local action of $\Gamma$ on $T_{d_t}$ contains $\mathrm{Alt}(d_t)$. We show that if $\Gamma$ is torsion-free and $d_1 = d_2 = 6$, exactly seven closed subgroups of $\mathrm{Aut}(T_6)$ arise in this way. We also construct two new infinite families of virtually simple lattices in $\mathrm{Aut}(T_{6}) \times \mathrm{Aut}(T_{4n})$ and in $\mathrm{Aut}(T_{2n}) \times \mathrm{Aut}(T_{2n+1})$ respectively, for all $n \geq 2$. In particular we provide an explicit presentation of a torsion-free infinite simple group on $5$ generators and $10$ relations, that splits as an amalgamated free product of two copies of $F_3$ over $F_{11}$. We include information arising from computer-assisted exhaustive searches of lattices in products of trees of small degrees. In an appendix by Pierre-Emmanuel Caprace, some of our results are used to show that abstract and relative commensurator groups of free groups are almost simple, providing partial answers to questions of Lubotzky and Lubotzky-Mozes-Zimmer.

Explore related subjects

Keep this discovery

BibTeXRIS

Nicolas Radu. 2017-12-04. New simple lattices in products of trees and their projections. https://doi.org/10.4153/s0008414x19000506

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