A general construction for optimal cyclic packing designs (Q1604562)

A packing design (or just packing) is a collection of \(k\)-element subsets (called blocks) out of a \(v\)-set \(V\) such that each pair of elements of \(V\) is contained in at most \(\lambda\) blocks. Optimal packings have the smallest possible number of blocks for given values of \(v\), \(k\), and \(\lambda\). The author presents recursive constructions of optimal cyclic packings, both unifying old results and producing new infinite series of these packings.