SearcharxivSearch

arXiv · 2304.04573

Probabilistic properties of profinite groups

Abstract

Let $\mathfrak C$ be a class of finite groups which is closed for subgroups, quotients and direct products. Given a profinite group $G$ and an element $x\in G$, we denote by $P_{\mathfrak{C}}(x,G)$ the probability that $x$ and a randomly chosen element of $G$ generate a pro-${\mathfrak C}$ subgroup. We say that a profinite group $G$ is $\mathfrak C$-positive if $P_{\mathfrak{C}}(x,G)>0$ for all $x \in G.$ %Moreover we say that $G$ is $\mathfrak C$-bounded-positive if there exists a positive constant $\eta$ such that $P_{\mathfrak{C}}(x,G)>\eta$ for all $x \in G.$ We establish several equivalent conditions for a profinite group to be $\mathfrak C$-positive when $\mathfrak C$ is the class of finite soluble groups or of finite nilpotent groups. In particular, for the above classes, the profinite $\mathfrak C$-positive groups are virtually prosoluble (resp., virtually nilpotent). We also draw some consequences on the prosoluble (resp. pronilpotent) graph of a profinite group.

Explore related subjects

Keep this discovery

BibTeXRIS

Eloisa Detomi, Andrea Lucchini, Marta Morigi, Pavel Shumyatsky. 2023-04-10. Probabilistic properties of profinite groups. https://arxiv.org/abs/2304.04573

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