Simple t-designs: a recursive construction for arbitrary t
From MaRDI portal
(Redirected from Publication:521850)
Simple \(t\)-designs: a recursive construction for arbitrary \(t\)
Simple \(t\)-designs: a recursive construction for arbitrary \(t\)
Abstract: The aim of this paper is to present a recursive construction of simple t-designs for arbitrary t. The construction is of purely combinatorial nature and it requires finding solutions for the indices of the ingredient designs that satisfy a certain set of equalities. We give a small number of examples to illustrate the construction, whereby we have found a large number of new t-designs, which were previously unknown. This indicates that the method is useful and powerful.
Recommendations
- A recursive construction for simple \(t\)-designs using resolutions
- Recursive constructions for \(s\)-resolvable \(t\)-designs
- On the construction of \(t\)-designs and the existence of some new infinite families of simple 5-designs
- On existence theorems for simple \(t\)-designs
- scientific article; zbMATH DE number 91012
Cites work
- scientific article; zbMATH DE number 3873337 (Why is no real title available?)
- scientific article; zbMATH DE number 91037 (Why is no real title available?)
- scientific article; zbMATH DE number 1057743 (Why is no real title available?)
- scientific article; zbMATH DE number 1382769 (Why is no real title available?)
- scientific article; zbMATH DE number 238435 (Why is no real title available?)
- A Steiner \(5\)-design on 36 points
- A family of 4-designs with block size 9
- A new family of 4-designs
- An infinite family of (simple) 6‐designs
- Combining \(t\)-designs
- Extending large sets of t-designs
- Locally trivial t-designs and t-designs without repeated blocks
- New infinite families of simple 5-designs
- Non-trivial \(t\)-designs without repeated blocks exist for all \(t\)
- On the construction of \(t\)-designs and the existence of some new infinite families of simple 5-designs
- On the existence of an infinite family of simple 5-designs
- Recursive constructions for 3-designs and resolvable 3-designs
- Simple \(8\)-designs with small parameters
- Simple non-trivial designs with an arbitrary automorphism group
- Some New 5-Designs
- The CRC handbook of combinatorial designs
- There exists a simple non trivial \(t\)-design with an arbitrarily large automorphism group for every \(t\)
- Unifying some known infinite families of combinatorial 3-designs
- t-designs on hypergraphs
Cited in
(11)- Recursive constructions for \(s\)-resolvable \(t\)-designs
- scientific article; zbMATH DE number 91012 (Why is no real title available?)
- A recursive method for construction of designs
- On existence theorems for simple \(t\)-designs
- scientific article; zbMATH DE number 637294 (Why is no real title available?)
- scientific article; zbMATH DE number 786181 (Why is no real title available?)
- Retracted article: ``Constructions for \(t\)-designs and \(s\)-resolvable \(t\)-designs
- scientific article; zbMATH DE number 2149825 (Why is no real title available?)
- Partially balanced t-designs
- A recursive construction for simple \(t\)-designs using resolutions
- scientific article; zbMATH DE number 1229681 (Why is no real title available?)
This page was built for publication: Simple \(t\)-designs: a recursive construction for arbitrary \(t\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q521850)
