Primitive permutation groups of degree 3p

2022/04/14 by Peter Neumann, Neumann, Peter M.
Engineering · Mathematics · #20B15 #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #Group Theory (math.GR) #Limits and Structures in Graph Theory #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.2204.06926

openalex publication_date 2022/04/14 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

This paper presents an analysis of primitive permutation groups of degree 3p, where p is a prime number, analogous to H. Wielandt's treatment of groups of degree 2p. It is also intended as an example of the systematic use of combinatorial methods as surveyed in \S6 for distilling information about a permutation group from knowledge of the decomposition of its character. The work is organised into three parts. Part I contains the lesser half of the calculation, the determination of the decomposition of the permutation character. Part II contains a survey of the combinatorial methods and, based on these methods, the major part of the calculation. Part III ties up loose ends left earlier in the paper and gives a tabulation of detailed numerical results.

Related

• The Primitive Permutation Groups of Degree Less Than 4096
• Association schemes with given stratum dimensions: on a paper of Peter M. Neumann
• THE PRIMITIVE PERMUTATION GROUPS OF SQUAREFREE DEGREE
• Permutation groups and normal subgroups
• Minimal degrees for faithful permutation representations of groups of order p⁶ where p is an odd prime