Counting lattices in products of trees (Q6140213)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Counting lattices in products of trees |
scientific article; zbMATH DE number 7791922
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting lattices in products of trees |
scientific article; zbMATH DE number 7791922 |
Statements
Counting lattices in products of trees (English)
0 references
19 January 2024
0 references
Summary: A BMW group of degree \((m,n)\) is a group that acts simply transitively on vertices of the product of two regular trees of degrees \(m\) and \(n\). We show that the number of commensurability classes of BMW groups of degree \((m,n)\) is bounded between \((mn)^{\alpha mn}\) and \((mn)^{\beta mn}\) for some \(0< \alpha < \beta\). In fact, we show that the same bounds hold for virtually simple BMW groups. We introduce a random model for BMW groups of degree \((m,n)\) and show that asymptotically almost surely a random BMW group in this model is irreducible and hereditarily just-infinite.
0 references
lattices
0 references
product of trees
0 references
simple groups
0 references
random complexes
0 references
\(\mathrm{CAT}(0)\) square complexes
0 references
0.7238776087760925
0 references
0.7123005390167236
0 references
0.7110700607299805
0 references
0.6971276998519897
0 references
0.6937389373779297
0 references