Skip to Main content Skip to Navigation
Journal articles

On the existence of block-transitive combinatorial designs

Abstract : 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.
Document type :
Journal articles
Complete list of metadata

Cited literature [32 references]  Display  Hide  Download

https://hal.inria.fr/hal-00990459
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Submitted on : Tuesday, May 13, 2014 - 3:37:37 PM
Last modification on : Wednesday, November 29, 2017 - 10:26:18 AM
Long-term archiving on: : Monday, April 10, 2017 - 10:12:46 PM

File

1047-4977-1-PB.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00990459, version 1

Collections

Citation

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

Share

Metrics

Record views

94

Files downloads

852