×

zbMATH — the first resource for mathematics

An algorithm for enumerating distinct cyclic Steiner systems. (English) Zbl 0755.05009
This paper presents an algorithm for finding all (0,1)-solutions to the matrix problem \(AX=J\), where \(A\) is (0,1)-matrix and \(J\) is the all 1’s column vector. It is applied to enumerate distinct cyclic Steiner systems of certain parameters. There are five newly-solved cases. The authors give neither correctness proof nor complexity bounds, therefore the further applicability of this algorithm is not easily deducible.

MSC:
05B07 Triple systems
05B20 Combinatorial aspects of matrices (incidence, Hadamard, etc.)
15A24 Matrix equations and identities
PDF BibTeX XML Cite