English

The Enumeration of Cyclic MNOLS

Combinatorics 2018-11-06 v2

Abstract

In this paper we study collections of mutually nearly orthogonal Latin squares (MNOLS\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 MNOLS\text{MNOLS} of order nn for n18n \leq 18, as well as providing a full enumeration of sets and lists of μ\mu cyclic MNOLS\text{MNOLS} of order nn under a variety of equivalences with n18n \leq 18. This resolves in the negative a conjecture that proposed the maximum μ\mu for which a set of μ\mu cyclic MNOLS\text{MNOLS} of order nn exists is n/4+1\lceil n/4\rceil +1.

Cite

@article{arxiv.1512.00997,
  title  = {The Enumeration of Cyclic MNOLS},
  author = {F. Demirkale and D. M. Donovan and J. I. Kokkala and T. G. Marbach},
  journal= {arXiv preprint arXiv:1512.00997},
  year   = {2018}
}

Comments

18 pages

R2 v1 2026-06-22T12:00:23.066Z