SearcharxivSearch

arXiv · 0907.1350

Lattices in complete rank 2 Kac-Moody groups

Abstract

Let Λbe a minimal Kac-Moody group of rank 2 defined over the finite field F_q, where q = p^a with p prime. Let G be the topological Kac-Moody group obtained by completing Λ. An example is G=SL_2(K), where K is the field of formal Laurent series over F_q. The group G acts on its Bruhat-Tits building X, a tree, with quotient a single edge. We construct new examples of cocompact lattices in G, many of them edge-transitive. We then show that if cocompact lattices in G do not contain p-elements, the lattices we construct are the only edge-transitive lattices in G, and that our constructions include the cocompact lattice of minimal covolume in G. We also observe that, with an additional assumption on p-elements in G, the arguments of Lubotzky for the case G = SL_2(K) may be generalised to show that there is a positive lower bound on the covolumes of all lattices in G, and that this minimum is realised by a non-cocompact lattice, a maximal parabolic subgroup of Lambda.

Explore related subjects

Keep this discovery

BibTeXRIS

Inna, Capdeboscq, Anne Thomas. 2011-06-09. Lattices in complete rank 2 Kac-Moody groups. https://arxiv.org/abs/0907.1350

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