Enumeration of MOLS of small order

J. Egan, I.M. Wanless

Research output: Contribution to journalArticlepeer-review


We report the results of a computer investigation of sets of mutually orthogonal Latin squares (MOLS) of small order. For n ≤ 9 we: (1) determine the number of orthogonal mates for each species of Latin square of order n; (2) calculate the proportion of Latin squares of order n that have an orthogonal mate, and the expected number of mates when a square is chosen uniformly at random; (3) classify all sets of MOLS of order n up to various different notions of equivalence. We also provide a triple of Latin squares of order 10 that is the closest to being a set of MOLS so far found. © 2015 American Mathematical Society.
Original languageEnglish
Pages (from-to)799-824
Number of pages26
JournalMathematics of Computation
Issue number298
Publication statusPublished - 2016
Externally publishedYes


Dive into the research topics of 'Enumeration of MOLS of small order'. Together they form a unique fingerprint.

Cite this