Recursive constructions for 3-designs and resolvable 3-designs (Q5954612): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q127100281, #quickstatements; #temporary_batch_1722205759638 |
||
(One intermediate revision by one other user not shown) | |||
Property / cites work | |||
Property / cites work: Extending t-designs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4063504 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A new family of 4-designs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4873725 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On resolvable designs \(S_ 3(3;4,v)\) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some mutually disjoint Steiner systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some resolutions of \(S(5,8,24)\) / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q127100281 / rank | |||
Normal rank |
Latest revision as of 00:57, 29 July 2024
scientific article; zbMATH DE number 1700930
Language | Label | Description | Also known as |
---|---|---|---|
English | Recursive constructions for 3-designs and resolvable 3-designs |
scientific article; zbMATH DE number 1700930 |
Statements
Recursive constructions for 3-designs and resolvable 3-designs (English)
0 references
4 February 2002
0 references
This paper deals with the problem of constructing 3-designs and resolvable 3-designs by using recursive methods, and the designs considered here are simple in the sense that they do not contain any repeated block. The constructions here rely on the doubling construction for Steiner quadruple systems and a generalization of the doubling construction. A \(t\)-\((v,k,\lambda)\) design \(D\) is a collection of \(k\)-subsets of a set \(S\) with \(v\) elements such that any \(t\)-subset of \(S\) appears in exactly \(\lambda\) blocks. Clearly BIBDs are such designs with \(t=2\). A resolvable \(t\)-\((v,k,\lambda)\) design \(D\) here is one such that the blocks of \(D\) can be partitioned into parallel classes, each class consisting of \(v/k\) pairwise disjoint blocks. In Section 2, the author presents many new families of 3-designs as well as of resolvable 3-designs by using a general form of the doubling construction for 3-designs. In the next two sections construction methods are presented which provide 3-designs whose number of points is not necessarily divisible by the block size. Section 5 deals with the constructions for 3-designs with block sizes \(k=5, 7\), and \(8\), and there is an appendix containing a list of parameters for the newly constructed 3-designs.
0 references
Steiner quadruple systems
0 references
doubling construction
0 references
resolvable 3-designs
0 references