On nilpotent and solvable quotients of primitive groups

2013/11/15 by Thomas Michael Keller, Yong Yang, Keller, Thomas Michael +1
Engineering · Mathematics · #FOS: Mathematics #Finite Group Theory Research #Group Theory (math.GR) #Limits and Structures in Graph Theory #graph theory and CDMA systems #math.GR

paper · pdf · doi:10.48550/arxiv.1311.4003

arxiv created 2013/11/15 · openalex publication_date 2013/11/15 · arxiv updated 2013/11/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

It is shown that if G is a primitive permutation group on a set of size n, then any nilpotent quotient of G has order at most n^β and any solvable quotient of G has order at most n^α+1 where β=log 32/ log 9 and α=(3 log (48)+log (24))/ (3 ⋅ log (9)). This was motivated by a result of Aschbacher and Guralnick

Related

• Classifying Solvable Primitive Permutation Groups of Low Rank
• Classifying Primitive Solvable Permutation Groups of Rank 5 and 6
• The Primitive Permutation Groups of Degree Less Than 4096
• Base sizes of primitive groups: bounds with explicit constants
• THE PRIMITIVE PERMUTATION GROUPS OF SQUAREFREE DEGREE