Simple t-designs: a recursive construction for arbitrary t

DOI10.1007/S10623-016-0238-ZzbMATH Open1359.05014arXiv1602.06751OpenAlexW2275326343MaRDI QIDQ521850FDOQ521850

Tran van Trung

Publication date: 12 April 2017

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

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.

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

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 Keywords

recursive constructionsimple \(t\)-design

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05)

Cites Work

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

Cited In (11)

• Recursive constructions for \(s\)-resolvable \(t\)-designs
• Title not available (Why is that?)
• A recursive method for construction of designs
• On existence theorems for simple \(t\)-designs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Retracted article: ``Constructions for \(t\)-designs and \(s\)-resolvable \(t\)-designs
• Title not available (Why is that?)
• Partially balanced t-designs
• A recursive construction for simple \(t\)-designs using resolutions
• Title not available (Why is that?)

Uses Software

• DISCRETA

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)