Non-trivial t-designs without repeated blocks exist for all t

DOI10.1016/0012-365X(87)90061-6zbMATH Open0625.05005MaRDI QIDQ579265FDOQ579265

Authors: Luc Teirlinck 

Publication date: 1987

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\). (Reprint)
• Locally trivial t-designs and t-designs without repeated blocks
• scientific article; zbMATH DE number 638676
• Nontrivial \(t\)-designs over finite fields exist for all \(t\)
• Nonexistence results for tight block designs
• scientific article; zbMATH DE number 3941553
• On the existence of block-transitive combinatorial designs
• On the non-existence of pair covering designs with at least as many points as blocks
• The non-existence of block-transitive subspace designs

zbMATH Keywords

constructiont-design

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05)

Cites Work

• The module structure of integral designs
• Title not available (Why is that?)
• Intersections among Steiner systems
• Intersection Properties of Steiner Systems
• On large sets of disjoint Steiner triple systems. VI
• Title not available (Why is that?)
• Title not available (Why is that?)
• Non-SUSY \(p\)-branes, bubbles and tubular branes

Cited In (45)

• Orthogonal decomposition and packing of complete graphs
• Intersecting designs
• Recursive constructions for \(s\)-resolvable \(t\)-designs
• Probabilistic existence of regular combinatorial structures
• Vertex-transitive self-complementary uniform hypergraphs of prime order
• Nontrivial \(t\)-designs over finite fields exist for all \(t\)
• The family of block designs with some combinatorial properties
• On completely regular codes
• Simple non-trivial designs with an arbitrary automorphism group
• An existence theorem for some simple \(t\)-designs
• Title not available (Why is that?)
• The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹
• Locally trivial t-designs and t-designs without repeated blocks
• Current research on algebraic combinatorics. Supplements to our book, Algebraic combinatorics I
• A prospect for a general method of constructing \(t\)-designs
• 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
• New \(t\)-designs and large sets of \(t\)-designs
• Large sets of subspace designs
• EXISTENCE OF -ANALOGS OF STEINER SYSTEMS
• Coloured and Directed Designs
• A method of constructing 2-resolvable \(t\)-designs for \(t=3,4\)
• Large sets of \(t\)-designs over finite fields exist for all \(t\)
• Graph and hypergraph packing
• Retracted article: ``Constructions for \(t\)-designs and \(s\)-resolvable \(t\)-designs
• Designs in finite metric spaces: a probabilistic approach
• An extending theorem for \(s\)-resolvable \(t\)-designs
• On balanced incomplete-block designs with repeated blocks
• Classification of partitions of all triples on ten points into copies of Fano and affine planes
• Probabilistic existence of large sets of designs
• Large sets with multiplicity
• Optimization, block designs and no free lunch theorems
• Point-missing \(s\)-resolvable \(t\)-designs: infinite series of 4-designs with constant index
• A survey on tight Euclidean \(t\)-designs and tight relative \(t\)-designs in certain association schemes
• Derived and residual subspace designs
• Title not available (Why is that?)
• Designs in a coset geometry: Delsarte theory revisited.
• Conformal designs based on vertex operator algebras
• Combinatorics. Abstracts from the workshop held January 1--7, 2023
• Block transitive resolutions of \(t\)-designs and Room rectangles
• Hamiltonicity and restricted block-intersection graphs of \(t\)-designs
• A recursive construction for simple \(t\)-designs using resolutions
• Title not available (Why is that?)
• Simple \(t\)-designs: a recursive construction for arbitrary \(t\)
• Codes and designs -- existence and uniqueness

This page was built for publication: Non-trivial \(t\)-designs without repeated blocks exist for all \(t\)

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