Counting lattices in products of trees
Abstract
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)α mn and (mn)β mn for some 0<α<β. 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.
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.