SearcharxivSearch

arXiv · 2604.16866

Uniformly Almost Flatness and Solubility in Finitely Generated Groups

Abstract

Tointon and the author conjectured that, for a finitely generated residually finite group, virtual nilpotence is equivalent to the condition that the diameters of its finite coset spaces admit a uniform polynomial lower bound in terms of their sizes. We first verify this conjecture for the class of finitely generated soluble groups. We then prove that this polynomial lower bound condition implies that the group has a finite-index subgroup whose finite quotients are all soluble. An immediate consequence of these two results is the verification of the conjecture for finitely generated linear groups. In addition, we establish the same conclusion for certain finitely generated abelian-by-cyclic groups under the weaker assumption that their finite quotients satisfy this polynomial lower bound condition.

Explore related subjects

Keep this discovery

BibTeXRIS

David Guo. 2026-04-18. Uniformly Almost Flatness and Solubility in Finitely Generated Groups. https://arxiv.org/abs/2604.16866

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