SearcharxivSearch

arXiv · 2605.22955

Finite groups with high commuting probability for Sylow subgroups

Abstract

Given two subsets $X,Y$ of a finite group $G$, we write $\Pr(X,Y)$ for the probability that random elements $x \in X$ and $y \in Y$ commute. If $X,Y$ are subgroups, we denote by $\Pr^*(X,Y)$ the maximum real number $\epsilon$ with the property that for every pair of distinct primes $p\in\pi(X)$ and $q\in\pi(Y)$ there is a Sylow $p$-subgroup $P$ of $X$ and a Sylow $q$-subgroup $Q$ of $Y$ such that $\Pr(P,Q) \geq \epsilon$. In this paper we handle, among other things, finite groups $G$ with high probabilities $\Pr^*(T,G)$, where $T$ is either a term of the lower central series of $G$ or the generalized Fitting subgroup $F_i^*(G)$. Our main results show that the structure of such groups is similar, in some precise sense, to that of nilpotent groups.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Eloisa Detomi, Débora Senise, Pavel Shumyatsky. 2026-05-21. Finite groups with high commuting probability for Sylow subgroups. https://arxiv.org/abs/2605.22955

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