SearcharxivSearch

arXiv · 2103.00425

Frobenius Groups with Perfect Order Classes

Abstract

The purpose of this paper is to investigate the finite Frobenius groups with "perfect order classes"; that is, those for which the number of elements of each order is a divisor of the order of the group. If a finite Frobenius group has perfect order classes then so too does its Frobenius complement, the Frobenius kernel is a homocyclic group of odd prime power order, and the Frobenius complement acts regularly on the elements of prime order in the Frobenius kernel. The converse is also true. Combined with elementary number-theoretic arguments, we use this to provide characterisations of several important classes of Frobenius groups. The insoluble Frobenius groups with perfect order classes are fully characterised. These turn out to be the perfect Frobenius groups whose Frobenius kernel is a homocyclic $11$-group of rank $2$. We also determine precisely which nilpotent Frobenius complements have perfect order classes, from which it follows that a Frobenius group with nilpotent complement has perfect order classes only if the Frobenius complement is a cyclic $\{2,3\}$-group of even order. Those Frobenius groups for which the Frobenius complement is a biprimary group are also described fully, and we show that no soluble Frobenius group whose Frobenius complement is a $\{2,3,5\}$-group with order divisible by $30$ has perfect order classes.

Explore related subjects

Keep this discovery

BibTeXRIS

James McCarron. 2021-02-28. Frobenius Groups with Perfect Order Classes. https://arxiv.org/abs/2103.00425

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