The Enumeration of Cyclic MNOLS

Abstract

In this paper we study collections of mutually nearly orthogonal Latin squares ($\text{MNOLS}$), which come from a modification of the orthogonal condition for mutually orthogonal Latin squares. In particular, we find the maximum $\mu$ such that there exists a set of $\mu$ cyclic $\text{MNOLS}$ of order $n$ for $n\le 18$, as well as providing a full enumeration of sets and lists of $\mu$ cyclic $\text{MNOLS}$ of order $n$ under a variety of equivalences with $n\le 18$. This resolves in the negative a conjecture that proposed the maximum $\mu$ for which a set of $\mu$ cyclic $\text{MNOLS}$ of order $n$ exists is $\lceil n/4\rceil +1$.

18 pages

References in corpus (1)

• Difference Covering Arrays and Pseudo-Orthogonal Latin Squares