SearcharxivSearch

arXiv · 2604.05123

Lattices determined by their commensurator

Abstract

Let $\Gamma$ be a finitely generated cocompact lattice of a totally disconnected locally compact group $G$, and $C$ a dense subgroup of $G$ that contains and commensurates $\Gamma$. We study the problem of describing all finitely generated commensurated subgroups of $C$. We establish general rigidity results ensuring every finitely generated commensurated subgroup of $C$ is virtually contained in $\Gamma$. In more concrete situations, in fact we conclude that up to commensurability, $\Gamma$ is the only infinite finitely generated commensurated subgroup of $C$. For instance this last conclusion holds when $G$ is the automorphism group of a tree. This settles in particular the problem whether two non-commensurable cocompact tree lattices may have the same commensurator. Further applications include commensurators of cocompact lattices in other groups of automorphisms of trees, as well as commensurators of graph product of finite groups in automorphism groups of right-angled building.

Explore related subjects

Keep this discovery

BibTeXRIS

Adrien Le Boudec, Colin Reid. 2026-04-06. Lattices determined by their commensurator. https://arxiv.org/abs/2604.05123

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