SearcharxivSearch

arXiv · 1509.01711

Rank, combinatorial cost and homology torsion growth in higher rank lattices

Abstract

We investigate the rank gradient and growth of torsion in homology in residually finite groups. As a tool, we introduce a new complexity notion for generating sets, using measured groupoids and combinatorial cost. As an application we prove the vanishing of the above invariants for Farber sequences of subgroups of right angled groups. A group is right angled if it can be generated by a sequence of elements of infinite order such that any two consecutive elements commute. Most non-uniform lattices in higher rank simple Lie groups are right angled. We provide the first examples of uniform (co-compact) right angled arithmetic groups in $\mathrm{SL}(n,\mathbb{R}),~n\geq 3$ and $\mathrm{SO}(p,q)$ for some values of $p,q$. This is a class of lattices for which the Congruence Subgroup Property is not known in general. Using rigidity theory and the notion of invariant random subgroups it follows that both the rank gradient and the homology torsion growth vanish for an arbitrary sequence of subgroups in any right angled lattice in a higher rank simple Lie group.

Explore related subjects

Keep this discovery

BibTeXRIS

Miklos Abert, Tsachik Gelander, Nikolay Nikolov. 2015-09-05. Rank, combinatorial cost and homology torsion growth in higher rank lattices. https://doi.org/10.1215/00127094-2017-0020

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