English

Counting lattices in products of trees

Group Theory 2022-02-02 v1 Geometric Topology Probability

Abstract

A BMW group of degree (m,n)(m,n) is a group that acts simply transitively on vertices of the product of two regular trees of degrees mm and nn. We show that the number of commensurability classes of BMW groups of degree (m,n)(m,n) is bounded between (mn)αmn(mn)^{\alpha mn} and (mn)βmn(mn)^{\beta mn} for some 0<α<β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)(m,n) and show that asymptotically almost surely a random BMW group in this model is irreducible and hereditarily just-infinite.

Keywords

Cite

@article{arxiv.2202.00378,
  title  = {Counting lattices in products of trees},
  author = {Nir Lazarovich and Ivan Levcovitz and Alex Margolis},
  journal= {arXiv preprint arXiv:2202.00378},
  year   = {2022}
}

Comments

25 pages, 5 figures