SearcharxivSearch

arXiv · 2310.02034

Solubilizers in profinite groups

Abstract

The solubilizer of an element $x$ of a profinite group $G$ is the set of the elements $y$ of $G$ such that the subgroup of $G$ generated by $x$ and $y$ is prosoluble. We propose the following conjecture: the solubilizer of $x$ in $G$ has positive Haar measure if and only if $g$ centralizes "almost all" the non-abelian chief factors of $G$. We reduce the proof of this conjecture to another conjecture concerning finite almost simple groups: there exists a positive $c$ such that, for every finite simple group $S$ and every $(a,b)\in (Aut(S)\setminus \{1\}) \times Aut(S)$, the number of $s$ is $S$ such that $\langle a, bs\rangle $ is insoluble is at least $c|S|$. Work in progress by Fulman, Garzoni and Guralnick is leading to prove the conjecture when $S$ is a simple group of Lie type. In this paper we prove the conjecture for alternating groups.

Explore related subjects

Keep this discovery

BibTeXRIS

Andrea Lucchini. 2023-10-03. Solubilizers in profinite groups. https://arxiv.org/abs/2310.02034

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