SearcharxivSearch

arXiv · 2410.02393

An Arad and Fisman's theorem on products of conjugacy classes revisited

Abstract

A theorem of Z. Arad and E. Fisman establishes that if $A$ and $B$ are two conjugacy classes of a finite group $G$ such that either $AB=A\cup B$ or $AB=A^{-1} \cup B$, then $G$ cannot be non-abelian simple. We demonstrate that, in fact, $\langle A\rangle = \langle B\rangle$ is solvable, the elements of $A$ and $B$ are $p$-elements for some prime $p$, and $\langle A\rangle $ is $p$-nilpotent. Moreover, under the second assumption, it turns out that $A=B$ and this is the only possible case. This research is done by appealing to recently developed techniques and results that are based on the Classification of Finite Simple Groups.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Antonio Beltrán, María José Felipe, Carmen Melchor. 2024-10-03. An Arad and Fisman's theorem on products of conjugacy classes revisited. https://arxiv.org/abs/2410.02393

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