Factorizations of symmetric designs (Q1111554)

A symmetric design is prime if every factorization XY of its incidence matrix A into (0,1) square matrices X and Y has either X or Y a permutation matrix. When every integer factorization \(k=rs\) of the block size k has \(r>\lambda\) or \(s>\lambda\), the authors prove that every (v,k,\(\lambda)\) symmetric design is prime. They further prove that if k is twice and odd prime and \(k>\lambda +1\), any (v,k,\(\lambda)\) symmetric design is prime. They exhibit a number of classes of factorable designs.