Counting lattices in products of trees

  • Nir Lazarovich

    Technion – Israel Institute of Technology, Haifa, Israel
  • Ivan Levcovitz

    Tufts University, Medford, USA
  • Alex Margolis

    The Ohio State University, Columbus, USA
Counting lattices in products of trees cover
Download PDF

This article is published open access under our Subscribe to Open model.

Abstract

A BMW group of degree is a group that acts simply transitively on vertices of the product of two regular trees of degrees and . We show that the number of commensurability classes of BMW groups of degree is bounded between and for some . In fact, we show that the same bounds hold for virtually simple BMW groups. We introduce a random model for BMW groups of degree and show that asymptotically almost surely a random BMW group in this model is irreducible and hereditarily just-infinite.

Cite this article

Nir Lazarovich, Ivan Levcovitz, Alex Margolis, Counting lattices in products of trees. Comment. Math. Helv. 98 (2023), no. 3, pp. 597–630

DOI 10.4171/CMH/559