SearcharxivSearch

arXiv · 2204.01496

Higher finiteness properties of arithmetic approximate lattices: The Rank Theorem for number fields

Abstract

We introduce geometric and homological finiteness properties for countable approximate groups via coarse geometry and then study these finiteness properties for S-arithmetic reductive approximate groups. For S-arithmetic approximate groups without infinite places we show that the finiteness length is finite and compute this finiteness length explicitly. In the simple case it is one less than the sum of the local ranks. This extends the Rank Theorem of Bux, K\"ohl and the second author from positive characteristic to characteristic zero. Our proof is based on a geometric version of their proof, but except for some input from reduction theory it is characteristic free. This indicates that the apparent differences between arithmetic groups in characteristic zero and positive characteristic concerning finiteness properties are entirely due to the presence of infinite places.

Explore related subjects

Keep this discovery

BibTeXRIS

Tobias Hartnick, Stefan Witzel. 2022-04-04. Higher finiteness properties of arithmetic approximate lattices: The Rank Theorem for number fields. https://arxiv.org/abs/2204.01496

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