Locally trivial t-designs and t-designs without repeated blocks
From MaRDI portal
Publication:1823945
The author constructed non-trivial t-designs without repeated blocks for all t in an earlier paper [Non-trivial t-designs without repeated blocks exist for all t, Discrete Math. 65, 301-311 (1987; Zbl 0625.05005)]. A simpler proof of the main result in the preceding paper is given here. Also, he surveys known results and presents new results on partitioning the set of all \((t+1)\)-subsets of a v-set into \(S(\lambda;t,t+1,v)\) for the smallest possible value of \(\lambda\).
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
Cites work
- A Small 4-Design
- scientific article; zbMATH DE number 3882436 (Why is no real title available?)
- scientific article; zbMATH DE number 3845586 (Why is no real title available?)
- Intersection Properties of Steiner Systems
- Intersections among Steiner systems
- Non-SUSY \(p\)-branes, bubbles and tubular branes
- Non-trivial \(t\)-designs without repeated blocks exist for all \(t\)
- On large sets of disjoint Steiner triple systems. VI
- On the maximum number of disjoint triple systems
- Some balanced complete block designs
- The existence of simple \(6\text{-}(14,7,4)\) designs
Cited in
(30)- Optimization, block designs and no free lunch theorems
- A generalisation of \(t\)-designs
- Hamiltonicity and restricted block-intersection graphs of t-designs
- New \(t\)-designs and large sets of \(t\)-designs
- More on halving the complete designs
- All block designs with \(b={v\choose k}/2\) exist
- A recursive construction for simple \(t\)-designs using resolutions
- A family of 4-designs with block size 9
- Simple non-trivial designs with an arbitrary automorphism group
- Large sets with multiplicity
- A method of constructing 2-resolvable \(t\)-designs for \(t=3,4\)
- Recursive constructions for s-resolvable t-designs
- Bounds and constructions of \(t\)-spontaneous emission error designs
- Large sets of \(t\)-designs over finite fields
- 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)\)
- An extending theorem for \(s\)-resolvable \(t\)-designs
- Constructing regular self-complementary uniform hypergraphs
- Restricted simple 1-designs
- Generalized covering designs and clique coverings
- scientific article; zbMATH DE number 3937186 (Why is no real title available?)
- Generalized packing designs
- scientific article; zbMATH DE number 4116543 (Why is no real title available?)
- Large sets of subspace designs
- Simple \(t\)-designs: a recursive construction for arbitrary \(t\)
- Non-trivial \(t\)-designs without repeated blocks exist for all \(t\)
- Some new 6-(14, 7, 4) designs
- Point-missing \(s\)-resolvable \(t\)-designs: infinite series of 4-designs with constant index
- Mutually disjoint Steiner systems from BCH codes
- Retracted article: ``Constructions for \(t\)-designs and \(s\)-resolvable \(t\)-designs
- Large sets of t-designs through partitionable sets: a survey
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)
