SearcharxivSearch

arXiv · 1102.0428

Higher finiteness properties of reductive arithmetic groups in positive characteristic: the rank theorem

Abstract

We show that the finiteness length of an $S$-arithmetic subgroup $Γ$ in a noncommutative isotropic absolutely almost simple group $G$ over a global function field is one less than the sum of the local ranks of $G$ taken over the places in $S$. This determines the finiteness properties for arithmetic subgroups in isotropic reductive groups, confirming the conjectured finiteness properties for this class of groups. Our main tool is Behr-Harder reduction theory which we recast in terms of the metric structure of euclidean buildings.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kai-Uwe Bux, Ralf Köhl, Stefan Witzel. 2011-02-02. Higher finiteness properties of reductive arithmetic groups in positive characteristic: the rank theorem. https://doi.org/10.4007/annals.2013.177.1.6

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