New simple lattices in products of trees and their projections
Abstract
Let ≤ Aut(Td1) × Aut(Td2) be a group acting freely and transitively on the product of two regular trees of degree d1 and d2. We develop an algorithm which computes the closure of the projection of on Aut(Tdt) under the hypothesis that dt ≥ 6 is even and that the local action of on Tdt contains Alt(dt). We show that if is torsion-free and d1 = d2 = 6, exactly seven closed subgroups of Aut(T6) arise in this way. We also construct two new infinite families of virtually simple lattices in Aut(T6) × Aut(T4n) and in Aut(T2n) × Aut(T2n+1) respectively, for all n ≥ 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 F3 over F11. 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.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.