Locally trivial t-designs and t-designs without repeated blocks

DOI10.1016/0012-365X(89)90372-5zbMATH Open0682.05011MaRDI QIDQ1823945FDOQ1823945

Authors: Luc Teirlinck 

Publication date: 1989

Published in: Discrete Mathematics (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 4116543
• Non-trivial \(t\)-designs without repeated blocks exist for all \(t\)
• Non-trivial \(t\)-designs without repeated blocks exist for all \(t\). (Reprint)
• scientific article; zbMATH DE number 3941553
• scientific article; zbMATH DE number 822741
• Publication:5753960
• A generalisation of \(t\)-designs
• \(t\)-designs with the number of blocks close to the Fisher type lower bound
• scientific article; zbMATH DE number 638676
• Graphical \(t\)-designs with block sizes three and four

zbMATH Keywords

t-designs without repeated blocks

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05)

Cites Work

• Intersections among Steiner systems
• Intersection Properties of Steiner Systems
• On large sets of disjoint Steiner triple systems. VI
• Some balanced complete block designs
• On the maximum number of disjoint triple systems
• Non-trivial \(t\)-designs without repeated blocks exist for all \(t\)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Non-SUSY \(p\)-branes, bubbles and tubular branes
• The existence of simple \(6\text{-}(14,7,4)\) designs
• A Small 4-Design

Cited In (31)

• Recursive constructions for \(s\)-resolvable \(t\)-designs
• Non-trivial \(t\)-designs without repeated blocks exist for all \(t\)
• A family of 4-designs with block size 9
• Simple non-trivial designs with an arbitrary automorphism group
• Title not available (Why is that?)
• All block designs with \(b={v\choose k}/2\) exist
• Simple \(8\)-\((31,12,3080)\), \(8\)-\((40,12,16200)\) and \(8\)-\((40,12,16520)\) designs from \(\mathrm{PSL}(3,5)\) and \(\mathrm{PSL}(4,3)\)
• Large sets of \(t\)-designs through partitionable sets: a survey
• Constructing regular self-complementary uniform hypergraphs
• Restricted simple 1-designs
• Generalized packing designs
• New \(t\)-designs and large sets of \(t\)-designs
• Large sets of subspace designs
• A method of constructing 2-resolvable \(t\)-designs for \(t=3,4\)
• A generalisation of \(t\)-designs
• Title not available (Why is that?)
• Generalized covering designs and clique coverings
• Retracted article: ``Constructions for \(t\)-designs and \(s\)-resolvable \(t\)-designs
• An extending theorem for \(s\)-resolvable \(t\)-designs
• Probabilistic existence of large sets of designs
• Large sets with multiplicity
• Bounds and constructions of \(t\)-spontaneous emission error designs
• Optimization, block designs and no free lunch theorems
• Mutually disjoint Steiner systems from BCH codes
• Large sets of \(t\)-designs over finite fields
• Point-missing \(s\)-resolvable \(t\)-designs: infinite series of 4-designs with constant index
• Some new 6-(14, 7, 4) designs
• Hamiltonicity and restricted block-intersection graphs of \(t\)-designs
• A recursive construction for simple \(t\)-designs using resolutions
• Simple \(t\)-designs: a recursive construction for arbitrary \(t\)
• More on halving the complete designs

This page was built for publication: Locally trivial t-designs and t-designs without repeated blocks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1823945)