SearcharxivSearch

arXiv · 2505.10521

Commuting probability for conjugate subgroups of a finite group

Abstract

Given two subgroups H,K of a finite group G, the probability that a pair of random elements from H and K commutes is denoted by \pr(H,K). We address the following question. Let P be a p-subgroup of a finite group G and assume that \pr(P,P^x)\geq\e>0 for every x\in G. Is the order of P modulo O_p(G) bounded in terms of e only? With respect to this question, we establish several positive results but show that in general the answer is negative. In particular, we prove that if the composition factors of G which are isomorphic to simple groups of Lie type in characteristic p, have Lie rank at most n, then the order of P modulo O_p(G) is bounded in terms of n and e only. If P is a Sylow p-subgroup of G, then the order of P modulo O_p(G) is bounded in terms e only. Some other results of similar flavour are established. We also show that if \pr(P_1,P_2)>0 for every two Sylow p-subgroups P_1,P_2 of a profinite group G, then O_{p,p'}(G) is open in G.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Eloisa Detomi, Robert M. Guralnick, Marta Morigi, Pavel Shumyatsky. 2025-05-15. Commuting probability for conjugate subgroups of a finite group. https://arxiv.org/abs/2505.10521

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