The Primitive Permutation Groups of Degree Less Than 4096

2011/10/01 by Hannah J. Coutts, Hannah Jane Coutts, Martyn Quick +2 · 4 citations
Mathematics · Computer Science · #Finite Group Theory Research #Coding theory and cryptography #Geometric and Algebraic Topology

paper · doi:10.1080/00927872.2010.515521

Abstract

In this article we use the Classification of the Finite Simple Groups, the O'Nan–Scott Theorem, and Aschbacher's theorem to classify the primitive permutation groups of degree less than 4096. The results will be added to the primitive groups databases of GAP and MAGMA.

Cited by

• Separating subsets from their images
• Line-transitive point-imprimitive linear spaces with Fang-Li parameter gcd(k,r) at most 10
• Finite permutation groups with quasi-semiregular elements
• On primitive 2-closed permutation groups of rank at most four

Related

• THE PRIMITIVE PERMUTATION GROUPS OF SQUAREFREE DEGREE
• Primitive permutation groups of degree 3p
• A classification of primitive permutation groups with finite stabilizers
• The non-synchronizing primitive groups of degree up to 624
• Base sizes of primitive groups: bounds with explicit constants