Simple t-designs: A recursive construction for arbitrary t

2016/02/22 by Tran van Trung, van Trung, Tran
Engineering · Mathematics · #05B05 #Combinatorics (math.CO) #FOS: Mathematics #graph theory and CDMA systems #math.CO #msc:05B05

paper · pdf · doi:10.48550/arxiv.1602.06751

12 pages

arxiv created 2016/02/22 · openalex publication_date 2016/02/22 · arxiv updated 2016/02/23 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Related

• A recursive construction for simple t-designs using resolution
• Explicit combinatorial design
• Combinatorial t-designs from quadratic functions
• Combinatorial t-designs from special polynomials
• A criterion for determining whether multiple shells support a t-design