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.
Recommendations
Cites work
- Combinatorial designs and related systems
- Enumeration of Symmetric Designs (25,9,3)
- scientific article; zbMATH DE number 3908438 (Why is no real title available?)
- scientific article; zbMATH DE number 3790437 (Why is no real title available?)
- scientific article; zbMATH DE number 3995714 (Why is no real title available?)
- On Minimal graphs of maximum even girth
- Primes in the semigroup of Boolean matrices
- The factors of a design matrix
Cited in
(9)- A characterization of the extensions of symmetric designs
- Elementarteiler von Inzidenzmatrizen symmetrischer Blockpläne. (Elementary divisors of incidence matrices of symmetric block designs)
- Symmetric designs, polarities and sub-designs
- Bruck-Ryser abstract theorem and symmetric designs
- Decomposable Symmetric Designs
- scientific article; zbMATH DE number 1228780 (Why is no real title available?)
- scientific article; zbMATH DE number 1043874 (Why is no real title available?)
- Symmetric factorial designs in blocks
- Integer LU-factorizations
This page was built for publication: Factorizations of symmetric designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1111554)
