On 1-Sarvate–Beam designs

The solution to a set theory exercise, “Partition the set of positive integers { 1 , 2 , … , v } into k subsets such that the sum of the elements in each subset is v ( v + 1 ) / ( 2 k ) whenever v ( v + 1 ) / ( 2 k ) is an integer”, gives a construction of non-simple 1-SB designs. This raises a natu...

Ausführliche Beschreibung