Finite Permutation Groups and Finite Simple Groups

1981/01/01 by Peter J. Cameron, Peter J‎. Cameron · 530 citations
Computer Science · Engineering · Mathematics · #Algebra over a field #Citation #Coding theory and cryptography #Combinatorics #Computer science #Epistemology #Finite Group Theory Research #Library science #Mathematics #Permutation (music) #Permutation group #Philosophy #Pure mathematics #Simple (philosophy) #graph theory and CDMA systems

paper · doi:10.1112/blms/13.1.1

published in Bulletin of the London Mathematical Society 13(1), 1-22 (Wiley)

openalex publication_date 1981/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In the past two decades, there have been far-reaching developments in the problem of determining all finite non-abelian simple groups—so much so, that many people now believe that the solution to the problem is imminent. And now, as I correct these proofs in October 1980, the solution has just been announced. Of

Cited by

• On the Sims Conjecture and Distance Transitive Graphs
• On the orbital diameter of classical groups in standard actions
• CI-groups with respect to ternary relational structures: new examples
• Modular forms applied to the computational inverse Galois problem
• Separating subsets from their images
• Primes in geometric series and finite permutation groups
• Line-transitive point-imprimitive linear spaces with Fang-Li parameter gcd(k,r) at most 10
• A Generation Criterion for Subsets of SL_n(\mathbbF_q)
• Finite 3-connected homogeneous graphs
• On primitive 2-closed permutation groups of rank at most four
• A Theorem of Siemons and Wagner
• Second maximal subgroups of the finite alternating and symmetric groups
• Edge-Transitive Homogeneous Factorisations of Complete Graphs
• Block-transitive 3-designs with small λ on sporadic simple groups
• The 2-Transitive Transplantable Isospectral Drums
• On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness
• Polynomial-time algorithms for finding elements of prime order and sylow subgroups
• Permutation groups generated by binomials
• Isomorphism of graphs of bounded valence can be tested in polynomial time
• Computational complexity and the classification of finite simple groups
• Canonical labeling of graphs
• Isomorhism of Hypergraphs of Low Rank in Moderately Exponential Time
• Isomorphism testing and canonical forms for k-contractable graphs (A generalization of bounded valence and bounded genus)
• Mathematical Methods in Computer Science: Essays in Memory of Thomas Beth
• Most primitive groups are full automorphism groups of edge-transitive hypergraphs
• Finite primitive distance-transitive graphs
• Hamiltonicity of vertex-transitive graphs of order 4 p
• The Theory of Finite Groups
• Low discrepancy sets yield approximate min-wise independent permutation families
• Rank 3 permutation group [wikipedia]

Related

• A counterexample for the conjecture of finite simple groups
• From uncountable abelian groups to uncountable nonabelian groups
• Generation of finite simple groups by an involution and an element of prime order
• The Quantitative Characterization of Finite Simple Groups
• The Ore conjecture