SearcharxivSearch

arXiv · 2608.22913

Uniform exponent bounds for integral group homology

Abstract

We prove that, in each fixed degree, the exponent of the integral homology of a finite group is bounded solely in terms of the degree and the exponent of the group. The proof combines the solution of the restricted Burnside problem with a representability property of the bar construction and may be viewed as a torsion analogue of the method of acyclic models. We also use the Lyndon--Hochschild--Serre spectral sequence to obtain explicit bounds for finite solvable and nilpotent groups in terms of their derived length and nilpotency class.

Explore related subjects

Keep this discovery

BibTeXRIS

Primoz Moravec. 2026-08-24. Uniform exponent bounds for integral group homology. https://arxiv.org/abs/2608.22913

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