Non-trivial \(t\)-designs without repeated blocks exist for all \(t\) (Q579265): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / review text | |||
A \(t\)-design \(S(\lambda;t,k,v)\) is a collection of \(k\)-subsets, called blocks, of a \(v\)-set \(S\) such that every \(t\)-subset of \(S\) is contained in exactly \(\lambda\) blocks. A \(t\)-design is called simple if it has no repeated blocks. It has been known for a long time that there are lots of \(S(\lambda;t,k,v)\) for all \(t\). However, until very recently, the only known simple \(t\)-designs with \(t\geq 6\) were the trivial \(S(\lambda;t,k,v)\) obtained by taking all \(k\)-subsets of a \(v\)-set, \(t\leq k\leq v\). \textit{S. S. Magliveras} and \textit{D. W. Leavitt} [Congr. Numerantium 40, 195--205 (1983; Zbl 0533.05008)] were the first to construct non-trivial simple 6-designs. In this paper, we construct an infinite number of non-trivial simple \(t\)-designs for all \(t\). | |||
Property / review text: A \(t\)-design \(S(\lambda;t,k,v)\) is a collection of \(k\)-subsets, called blocks, of a \(v\)-set \(S\) such that every \(t\)-subset of \(S\) is contained in exactly \(\lambda\) blocks. A \(t\)-design is called simple if it has no repeated blocks. It has been known for a long time that there are lots of \(S(\lambda;t,k,v)\) for all \(t\). However, until very recently, the only known simple \(t\)-designs with \(t\geq 6\) were the trivial \(S(\lambda;t,k,v)\) obtained by taking all \(k\)-subsets of a \(v\)-set, \(t\leq k\leq v\). \textit{S. S. Magliveras} and \textit{D. W. Leavitt} [Congr. Numerantium 40, 195--205 (1983; Zbl 0533.05008)] were the first to construct non-trivial simple 6-designs. In this paper, we construct an infinite number of non-trivial simple \(t\)-designs for all \(t\). / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Luc Teirlinck / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05B05 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 4014733 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
construction | |||
Property / zbMATH Keywords: construction / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
t-design | |||
Property / zbMATH Keywords: t-design / rank | |||
Normal rank |
Revision as of 18:23, 1 July 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Non-trivial \(t\)-designs without repeated blocks exist for all \(t\) |
scientific article |
Statements
Non-trivial \(t\)-designs without repeated blocks exist for all \(t\) (English)
0 references
1987
0 references
A \(t\)-design \(S(\lambda;t,k,v)\) is a collection of \(k\)-subsets, called blocks, of a \(v\)-set \(S\) such that every \(t\)-subset of \(S\) is contained in exactly \(\lambda\) blocks. A \(t\)-design is called simple if it has no repeated blocks. It has been known for a long time that there are lots of \(S(\lambda;t,k,v)\) for all \(t\). However, until very recently, the only known simple \(t\)-designs with \(t\geq 6\) were the trivial \(S(\lambda;t,k,v)\) obtained by taking all \(k\)-subsets of a \(v\)-set, \(t\leq k\leq v\). \textit{S. S. Magliveras} and \textit{D. W. Leavitt} [Congr. Numerantium 40, 195--205 (1983; Zbl 0533.05008)] were the first to construct non-trivial simple 6-designs. In this paper, we construct an infinite number of non-trivial simple \(t\)-designs for all \(t\).
0 references
construction
0 references
t-design
0 references