Article Dans Une Revue Discrete Mathematics and Theoretical Computer Science Année : 2010

On the existence of block-transitive combinatorial designs

Résumé

Block-transitive Steiner t-designs form a central part of the study of highly symmetric combinatorial configurations at the interface of several disciplines, including group theory, geometry, combinatorics, coding and information theory, and cryptography. The main result of the paper settles an important open question: There exist no non-trivial examples with t = 7 (or larger). The proof is based on the classification of the finite 3-homogeneous permutation groups, itself relying on the finite simple group classification.

Fichier principal
Vignette du fichier
1047-4977-1-PB.pdf (161.94 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence
Loading...

Dates et versions

hal-00990459 , version 1 (13-05-2014)

Licence

Identifiants

Citer

Michael Huber. On the existence of block-transitive combinatorial designs. Discrete Mathematics and Theoretical Computer Science, 2010, Vol. 12 no. 1 (1), pp.123-132. ⟨10.46298/dmtcs.516⟩. ⟨hal-00990459⟩

Collections

110 Consultations
1574 Téléchargements

Altmetric

Partager

  • More