On the automorphisms of designs constructed from finite simple groups
Abstract
Here we study the automorphism groups of 1-designs constructed from finite nonabelian simple groups by using two methods presented in Moori (Information Security, Coding Theory and Related Combinatorics, 2011). We obtain some general results for both and improve one of these methods. In an application to the sporadic Mathieu groups Mn, we are able to retrieve the Steiner systems S(t,t+3,n) where (n,t)∈\(22,3),(23,4),(24,5)\.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.