SearcharxivSearch

arXiv · 2608.03003

The solution to Kourovka problem 21.88

Abstract

We give a negative answer to Kourovka Notebook Problem 21.88: no finite group of odd order has commuting probability $1/17$. This follows from a structural theorem asserting that, whenever $p$ is an odd prime and $cp(G)=1/p$, a Sylow $p$-subgroup of $G$ is normal and abelian. Together with Burnside's congruence for the number of conjugacy classes of a group of odd order, this also excludes $cp(G)=1/p$ for every odd prime $p<97$. We further study the next unresolved case not excluded by this congruence, namely $p=97$.

Explore related subjects

Keep this discovery

BibTeXRIS

Basile Beyer de Ryke. 2026-08-04. The solution to Kourovka problem 21.88. https://arxiv.org/abs/2608.03003

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