Papers
Topics
Authors
Recent
Search
2000 character limit reached

The Enumeration of Cyclic MNOLS

Published 3 Dec 2015 in math.CO | (1512.00997v2)

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 \leq 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 \leq 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$.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.