New simple lattices in products of trees and their projections
Nicolas Radu

TL;DR
This paper introduces an algorithm to analyze projections of certain free and transitive groups acting on products of regular trees, leading to new classifications and constructions of simple lattices in automorphism groups of trees.
Contribution
It develops an algorithm for computing projections of groups acting on product of trees and constructs new infinite families of virtually simple lattices in automorphism groups.
Findings
Seven closed subgroups of Aut(T_6) arise from the projections.
Constructed two new families of virtually simple lattices.
Provided an explicit presentation of a torsion-free infinite simple group.
Abstract
Let be a group acting freely and transitively on the product of two regular trees of degree and . We develop an algorithm which computes the closure of the projection of on under the hypothesis that is even and that the local action of on contains . We show that if is torsion-free and , exactly seven closed subgroups of arise in this way. We also construct two new infinite families of virtually simple lattices in and in respectively, for all . In particular we provide an explicit presentation of a torsion-free infinite simple group on generators and relations, that…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
