Recursive constructions for \(s\)-resolvable \(t\)-designs
type: Item
instance of: scholarly article
title: Recursive constructions for \(s\)-resolvable \(t\)-designs
zbMATH Open document ID: 1434.05024
author: Tran van Trung
published in: Designs, Codes and Cryptography
publication date: 2019-11-07T00:00:00Z
review text: A \(t\)-\((v,k, \lambda)\) design \((\mathcal P,\mathcal B)\) is said to be \(s\)-resolvable with \(0 < s < t\), if its block set \(\mathcal B\) can be partitioned into \(N \ge 2\) classes \(\mathcal B_1, \ldots , \mathcal B_N\) such that each \((\mathcal P,\mathcal B_i)\), \(i=1, \ldots ,N\), is an \(s\)-\((v,k,\delta)\) design. The notion of an \(s\)-resolvable \(t\)-design is a generalization of the notion of a large set of \(s\)-designs. In this paper, the author gives recursive constructions of \(s\)-resolvable simple \(t\)-designs, for \(t \ge 3\) and \(1 \le s < t\). As an example, he gives a construction of an infinite family of 3-resolvable simple 4-designs with parameters 4-\((2^n+2,7,70(2^n-2)/3)\), \(\gcd(n,6)=1\), \(n \ge 5\).
reviewed by: Dean Crnković
Mathematics Subject Classification ID: 05B05
zbMATH DE Number: 7127670
zbMATH Keywords: \(s\)-resolvable
zbMATH Keywords: simple \(t\)-design
zbMATH Keywords: recursive construction
MaRDI profile type: MaRDI publication profile
full work available at URL: s10623-019-00653-6
OpenAlex ID: W2953145868
cites work: Extending large sets of \(t\)-designs
cites work: An infinite class of 4-designs
cites work: Partitioning the planes of \(AG_{2m}(2)\) into 2-designs
cites work: Q4718791
cites work: Steiner systems with automorphism groups \(PSL(2,71)\), \(PSL(2,83)\), and \(P\Sigma L(2,3^5)\)
cites work: A new family of 4-designs
cites work: A family of 4-designs with block size 9
cites work: Some friends of Alltop's designs \(4\)-\((2^f+1,5,5)\)
cites work: The CRC handbook of combinatorial designs
cites work: Semiregular large sets
cites work: Q4796692
cites work: Q3784080
cites work: Combining \(t\)-designs
cites work: Q5287875
cites work: Q4876923
cites work: New large sets of \(t\)-designs
cites work: New large sets oft-designs with prescribed groups of automorphisms
cites work: New infinite families of simple 5-designs
cites work: Non-trivial \(t\)-designs without repeated blocks exist for all \(t\)
cites work: Locally trivial t-designs and t-designs without repeated blocks
cites work: Some new 2-resolvable Steiner quadruple systems
cites work: On the existence of an infinite family of simple 5-designs
cites work: On the construction of \(t\)-designs and the existence of some new infinite families of simple 5-designs
cites work: Simple \(t\)-designs: a recursive construction for arbitrary \(t\)
cites work: A recursive construction for simple \(t\)-designs using resolutions
cites work: Q4017182
Wikidata QID: Q127653841
DOI: 10.1007/S10623-019-00653-6
Recommended article: A recursive construction for simple \(t\)-designs using resolutions
Recommended article: Resolvable \(t\)-designs
Recommended article: An extending theorem for \(s\)-resolvable \(t\)-designs
Recommended article: A construction for resolvable designs and its generalizations
Recommended article: Recursive constructions for 3-designs and resolvable 3-designs
Recommended article: Q4723750
Recommended article: Simple \(t\)-designs: a recursive construction for arbitrary \(t\)
Recommended article: Q4697604
Recommended article: Some tuple system constructions with applications to resolvable designs
description: scientific article; zbMATH DE number 7127670