Non-trivial \(t\)-designs without repeated blocks exist for all \(t\) (Q579265)

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\).