SearcharxivSearch

arXiv · 2311.10454

Commuting probability for the Sylow subgroups of a finite group

Abstract

For subsets $X,Y$ of a finite group $G$, let $Pr(X,Y)$ denote the probability that two random elements $x\in X$ and $y\in Y$ commute. Obviously, a finite group $G$ is nilpotent if and only if $Pr(P,Q)=1$ whenever $P$ and $Q$ are Sylow subgroups of $G$ of coprime orders. Suppose that $G$ is a finite group in which for any distinct primes $p,q\in\pi(G)$ there is a Sylow $p$-subgroup $P$ and a Sylow $q$-subgroup $Q$ of $G$ such that $Pr(P,Q) \ge \epsilon$. We show that $F_2(G)$ has $\epsilon$-bounded index in $G$. If $G$ is a finite soluble group in which for any prime $p\in\pi(G)$ there is a Sylow $p$-subgroup $P$ and a Hall $p'$-subgroup $H$ such that $Pr(P,H)\ge \epsilon$, then $F(G)$ has $\epsilon$-bounded index in $G$. Moreover, we establish criteria for nilpotency and solubility of $G$ such as: If for any primes $p,q\in\pi(G)$ the group $G$ has a Sylow $p$-subgroup $P$ and a Sylow $q$-subgroup $Q$ with $Pr(P,Q)>2/3$, then $G$ is nilpotent. If for any primes $p,q\in\pi(G)$ the group $G$ has a Sylow $p$-subgroup $P$ and a Sylow $q$-subgroup $Q$ with $Pr(P,Q)>2/5$, then $G$ is soluble.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Eloisa Detomi, Andrea Lucchini, Marta Morigi, Pavel Shumyatsky. 2023-11-17. Commuting probability for the Sylow subgroups of a finite group. https://arxiv.org/abs/2311.10454

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