Steiner systems $S(2,6,226)$ and $S(2,6,441)$ exist
Taras Banakh, Ivan Hetman, Alex Ravsky

TL;DR
This paper reports the discovery of specific Steiner systems using computer search, resolving two previously undecided cases in the classification of such systems.
Contribution
The authors identified new Steiner systems $S(2,6,226)$ and $S(2,6,441)$, advancing the classification of these combinatorial designs.
Findings
Found seven non-isomorphic 1-rotational Steiner systems $S(2,6,226)$
Discovered six point-transitive Steiner systems $S(2,6,441)$
Resolved two of 29 previously undecided cases for $S(2,6,v)$
Abstract
Via computer search, we found seven non-isomorphic -rotational Steiner systems and six point-transitive Steiner systems , resolving two of previously undecided cases for .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Optimal Experimental Design Methods · Limits and Structures in Graph Theory
