On the automorphisms of designs constructed from finite simple groups

Tung Le; Jamshid Moori

On the automorphisms of designs constructed from finite simple groups

Group Theory 2014-05-13 v1 Combinatorics

Authors: Tung Le , Jamshid Moori

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 $M_{n}$ , we are able to retrieve the Steiner systems $S(t,t+3,n)$ where $(n,t)\in\{(22,3),(23,4),(24,5)\}$ .

Keywords

automorphism groups 1-designs finite simple groups Moori methods Mathieu groups Steiner systems combinatorics

Cite

@article{arxiv.1405.2405,
  title  = {On the automorphisms of designs constructed from finite simple groups},
  author = {Tung Le and Jamshid Moori},
  journal= {arXiv preprint arXiv:1405.2405},
  year   = {2014}
}

Comments

12 pages

On the automorphisms of designs constructed from finite simple groups

Abstract

Keywords

Cite

Comments

Related papers