Finite Permutation Groups and Finite Simple Groups

1981/01/01 by Peter J. Cameron, Peter J‎. Cameron · 7 citations
Mathematics · Computer Science · Engineering · #Finite Group Theory Research #Coding theory and cryptography #graph theory and CDMA systems

paper · doi:10.1112/blms/13.1.1

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
• A Generation Criterion for Subsets of SL_n(\mathbbF_q)

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
• An incoherent simple group