Probabilistic finiteness properties for profinite groups

Ged Corob Cook; Matteo Vannacci

Home/Archive/arXiv

arXiv · 1907.05063

Probabilistic finiteness properties for profinite groups

Ged Corob Cook·Matteo Vannacci

View original source ↗Read source document ↗Export metadata ↓

Abstract

We introduce various probablistic finiteness conditions for profinite groups related to positive finite generation (PFG). We investigate completed group rings which are PFG as modules, and use this to answer a question of Kionke and the second author on positively finitely related groups. Using the theory of projective covers, we define and characterise a probabilistic version of the $\mathrm{FP}_n$ property for profinite groups, called $\mathrm{PFP}_n$. Finally, we prove how these conditions are related to previously defined finiteness conditions and each other.

Explore related subjects

math.GR

Keep this discovery

BibTeX RIS

Ged Corob Cook, Matteo Vannacci. 2019-07-11. Probabilistic finiteness properties for profinite groups. https://arxiv.org/abs/1907.05063

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

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↗

arXiv2026

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↗

arXiv2026

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↗