SearcharxivSearch

arXiv · 1310.8401

On the commuting probability and supersolvability of finite groups

Abstract

For a finite group $G$, let $d(G)$ denote the probability that a randomly chosen pair of elements of $G$ commute. We prove that if $d(G)>1/s$ for some integer $s>1$ and $G$ splits over an abelian normal nontrivial subgroup $N$, then $G$ has a nontrivial conjugacy class inside $N$ of size at most $s-1$. We also extend two results of Barry, MacHale, and N\'ı Shé on the commuting probability in connection with supersolvability of finite groups. In particular, we prove that if $d(G)>5/16$ then either $G$ is supersolvable, or $G$ isoclinic to $A_4$, or $G/\Center(G)$ is isoclinic to $A_4$.

Explore related subjects

Keep this discovery

BibTeXRIS

Paul Lescot, Hung Ngoc Nguyen, Yong Yang. 2013-10-31. On the commuting probability and supersolvability of finite groups. https://arxiv.org/abs/1310.8401

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