Graphs and complexes of lattices
Abstract
We study lattices acting on CAT(0) spaces via their commensurated subgroups. To do this we introduce the notions of a graph of lattices and a complex of lattices giving graph and complex of group splittings of CAT(0) lattices. Using this framework we characterise irreducible uniform (Isom(En)× T)-lattices by C-simplicity and give a necessary condition for lattices in products with a Euclidean factor to be biautomatic. We also construct non-residually finite uniform lattices acting on arbitrary products of right-angled buildings and non-biautomatic lattices acting on the product of En and a right-angled building.
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.