Enumeration of MOLS of small order
Judith Egan, Ian Wanless
Source abstract
We report the results of a computer investigation of sets of mutually orthogonal Latin squares (MOLS) of small order. For n ⩽ 9 n\leqslant 9 we: determine the number of orthogonal mates for each species of Latin square of order n n ; calculate the proportion of Latin squares of order n n that have an orthogonal mate, and the expected number of mates when a square is chosen uniformly at random; classify all sets of MOLS of order n 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.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.