The Enumeration of Cyclic MNOLS
F. Demirkale, D.M. Donovan, J.I. Kokkala, T.G. Marbach

TL;DR
This paper investigates cyclic MNOLS, determining the maximum number for orders up to 18 and providing comprehensive enumeration, thereby disproving a previous conjecture about their maximum size.
Contribution
It establishes the maximum size of cyclic MNOLS for orders up to 18 and fully enumerates their configurations, challenging existing conjectures.
Findings
Maximum $ ext{MNOLS}$ sets identified for $n \,\leq\, 18$
Complete enumeration of cyclic $ ext{MNOLS}$ for these orders
Disproof of the conjecture relating maximum size to $\lceil n/4 \rceil + 1$
Abstract
In this paper we study collections of mutually nearly orthogonal Latin squares (), which come from a modification of the orthogonal condition for mutually orthogonal Latin squares. In particular, we find the maximum such that there exists a set of cyclic of order for , as well as providing a full enumeration of sets and lists of cyclic of order under a variety of equivalences with . This resolves in the negative a conjecture that proposed the maximum for which a set of cyclic of order exists is .
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 · Cellular Automata and Applications
