SearcharxivSearch

arXiv · 2608.03935

The structure of finite groups invariably generated by two elements of prime order

Abstract

A group $G$ is invariably generated by two elements $a$ and $b$ if $G=\langle a^g,b^h\rangle $ for all $g,h\in G$. This paper provides a structural description of finite groups invariably generated by two elements of distinct prime orders $s$ and $t$. We illustrate the use of our main result in a case study with $s=2$ and $t=3$. In particular we prove that an almost simple group is invariably generated by an element of order $2$ and an element of order $3$ if and only if it is isomorphic to $\mathrm{PGL}_2(3^{2^b})$ for some $b \ge 1$.

Explore related subjects

Keep this discovery

BibTeXRIS

Inna Capdeboscq, Chris Parker. 2026-08-04. The structure of finite groups invariably generated by two elements of prime order. https://arxiv.org/abs/2608.03935

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