Simple \(t\)-designs: a recursive construction for arbitrary \(t\)

DOI10.1007/s10623-016-0238-zzbMath1359.05014arXiv1602.06751OpenAlexW2275326343MaRDI QIDQ521850

Tran van Trung

Publication date: 12 April 2017

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1602.06751

zbMATH Keywords

recursive constructionsimple \(t\)-design

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05)

Related Items

On existence theorems for simple \(t\)-designs, Partially balanced t-designs, A recursive construction for simple \(t\)-designs using resolutions, Recursive constructions for \(s\)-resolvable \(t\)-designs

Uses Software

• DISCRETA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Non-trivial \(t\)-designs without repeated blocks exist for all \(t\)
• On the existence of an infinite family of simple 5-designs
• On the construction of \(t\)-designs and the existence of some new infinite families of simple 5-designs
• New infinite families of simple 5-designs
• Combining \(t\)-designs
• t-designs on hypergraphs
• Simple \(8\)-designs with small parameters
• Locally trivial t-designs and t-designs without repeated blocks
• A family of 4-designs with block size 9
• Simple non-trivial designs with an arbitrary automorphism group
• A new family of 4-designs
• Extending large sets of \(t\)-designs
• A Steiner \(5\)-design on 36 points
• Unifying some known infinite families of combinatorial 3-designs
• Some New 5-Designs
• An infinite family of (simple) 6‐designs
• There exists a simple non trivial \(t\)-design with an arbitrarily large automorphism group for every \(t\)
• Recursive constructions for 3-designs and resolvable 3-designs