The primitive permutation groups of degree less than 2500

By C. Roney‐Dougal. 2005

52 citations recorded by the source corpus.

Abstract In this paper we use the O'Nan–Scott Theorem and Aschbacher's theorem to classify the primitive permutation groups of degree less than 2500.

Subfields: Artificial Intelligence, Discrete Mathematics and Combinatorics, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/67563d147ec27e1be6b7b9b8d1420b46832430db

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

1. Maria Elisa Fernandes
2. Dimitri Leemans
3. Delu Tian
4. Shenglin Zhou

In Discrete Mathematics and Combinatorics

1. Maria Elisa Fernandes
2. Dimitri Leemans
3. Delu Tian
4. Shenglin Zhou

In Electrical and Electronic Engineering

1. Maria Elisa Fernandes
2. Dimitri Leemans
3. Delu Tian
4. Shenglin Zhou

Citations in the corpus

• Polytopes of high rank for the symmetric groups (2011, background): “Exhaustive lists of primitive subgroups of Sn exist up to a certain degree (see for instance [1,16]).”
• Flag‐Transitive Point‐Primitive Symmetric (ν,κ,λ) Designs With λ at Most 100 (2013, methodology): “By [17] and using GAP[8], we get five 4-tuples (λ, a, m, k) in Table III satisfying the following conditions:”