Cyclic Incidence Matrices

Abstract
Let it be required to arrange v elements into v sets such that each set contains exactly k distinct elements and such that each pair of sets has exactly λ elements in common (0 < λ < k < v). This problem we refer to as the v, k,λ combinatorial problem.