SearcharxivSearch

arXiv · 0812.2280

Density of commensurators for uniform lattices of right-angled buildings

Abstract

Let G be the automorphism group of a regular right-angled building X. The "standard uniform lattice" Γ_0 in G is a canonical graph product of finite groups, which acts discretely on X with quotient a chamber. We prove that the commensurator of Γ_0 is dense in G. This result was also obtained by Haglund. For our proof, we develop carefully a technique of "unfoldings" of complexes of groups. We use unfoldings to construct a sequence of uniform lattices Γ_n in G, each commensurable to Γ_0, and then apply the theory of group actions on complexes of groups to the sequence Γ_n. As further applications of unfoldings, we determine exactly when the group G is nondiscrete, and we prove that G acts strongly transitively on X.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Angela Kubena, Anne Thomas. 2012-05-25. Density of commensurators for uniform lattices of right-angled buildings. https://arxiv.org/abs/0812.2280

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR