SearcharxivSearch

arXiv · 1511.09286

A family of uniform lattices acting on a Davis complex with a non-discrete set of covolumes

Abstract

Let $(W,S)$ be a Coxeter system with Davis complex $Σ$. The polyhedral automorphism group $G$ of $Σ$ is a locally compact group under the compact-open topology. If $G$ is a discrete group (as characterised by Haglund--Paulin), then the set $\mathcal V_u(G)$ of uniform lattices in $G$ is discrete. Whether the converse is true remains an open problem. Under certain assumptions on $(W,S)$, we show that $\mathcal V_u(G)$ is non-discrete and contains rationals (in lowest form) with denominators divisible by arbitrarily large powers of any prime less than a fixed integer. We explicitly construct our lattices as fundamental groups of complexes of groups with universal cover $Σ$. We conclude with a new proof of an already known analogous result for regular right-angled buildings.

Explore related subjects

Keep this discovery

BibTeXRIS

Damian Sercombe. 2015-11-30. A family of uniform lattices acting on a Davis complex with a non-discrete set of covolumes. https://arxiv.org/abs/1511.09286

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