2021/02/28 by James McCarron, McCarron, James
Computer Science · Engineering · Mathematics · #11A05 #11A07 #11D99 (Secondary) #20D60 (Primary) #20D99 #20E45 #20E99 #Coding theory and cryptography #FOS: Computer and information sciences #FOS: Mathematics #Finite Group Theory Research #Group Theory (math.GR) #Number Theory (math.NT) #Symbolic Computation (cs.SC) #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.2103.00425
openalex publication_date 2021/02/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.