Enumeration of MOLS of small order

DOI10.1090/MCOM/3010MaRDI QIDQ2792342zbMATH OpenOpenAlexFDO

Authors Judith Egan, Ian M. Wanless

Publication date 9 March 2016

Published in Mathematics of Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1406.3681

zbMATH Keywords

MOLStransversalLatin squareplexorthogonal mate

Mathematics Subject Classification ID

Design of statistical experiments (62K99) Orthogonal arrays, Latin squares, Room squares (05B15) Transversal (matching) theory (05D15)

Abstract: We report the results of a computer investigation of sets of mutually orthogonal latin squares (MOLS) of small order. For $nle9$ 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.

Recommendations

• scientific article; zbMATH DE number 874490
• Small latin squares, quasigroups, and loops
• The enumeration of cyclic mutually nearly orthogonal Latin squares
• scientific article; zbMATH DE number 1286747
• Enumeration and isomorphic classification of self-orthogonal Latin squares

Cites work

• scientific article; zbMATH DE number 1455120 (Why is no real title available?)
• scientific article; zbMATH DE number 3443668 (Why is no real title available?)
• scientific article; zbMATH DE number 798642 (Why is no real title available?)
• scientific article; zbMATH DE number 933209 (Why is no real title available?)
• scientific article; zbMATH DE number 4183425 (Why is no real title available?)
• A generalization of transversals for Latin squares
• Aspects of complete sets of \(9\times 9\) pairwise orthogonal latin squares
• Atomic Latin squares of order eleven
• Classification algorithms for codes and designs
• Complete sets of pairwise orthogonal Latin squares and the corresponding projective planes
• Constructing combinatorial objects via cliques
• Indivisible partitions of Latin squares
• Latin squares with restricted transversals
• Latin squares without orthogonal mates
• Maximal difference matrices of order \(\leq 10\)
• Maximal sets of Latin squares and partial transversals
• Monogamous latin squares
• On the number of Latin squares
• On the number of transversal designs
• Perfect factorisations of bipartite graphs and Latin squares without proper subrectangles
• Practical graph isomorphism. II.
• Small latin squares, quasigroups, and loops
• THE 7 × 7 SQUARES
• The CRC handbook of combinatorial designs
• The existence and construction of two families of designs for two successive experiments
• The existence of Latin squares without orthogonal mates
• The non-existence of maximal sets of four mutually orthogonal Latin squares of order 8
• The number of Latin squares of order 11
• The number of different reduced complete sets of MOLS corresponding to \(\mathrm{PG} (2,q)\)
• The number of transversals in a Latin square
• The structure of conjugacy closed loops

Cited in

(33)

• Diagonal groups and arcs over groups
• Difference matrices toward \(\mathrm{MOLS}\) of order 10
• Construction of generalized minimum aberration three-level orthogonal arrays with three, four and five columns
• Uniform semi-Latin squares and their pairwise-variance aberrations
• On the non-existence of extended 1-perfect codes and MDS codes
• Multi-directional unitarity and maximal entanglement in spatially symmetric quantum states
• The number of different reduced complete sets of MOLS corresponding to \(\mathrm{PG} (2,q)\)
• Autoparatopisms of Quasigroups and Latin Squares
• Orthogonal trades and the intersection problem for orthogonal arrays
• Integer programming for classifying orthogonal arrays
• Enumerating extensions of mutually orthogonal Latin squares
• Existence of Five MOLS of Orders 18 and 60
• Tic-Tac-Toe on designs
• Sets of MOLSs generated from a single Latin square
• Local permutation polynomials and the action of e-Klenian groups
• Finding the symmetry group of an LP with equality constraints and its application to classifying orthogonal arrays
• Further results on the classification of MDS codes
• Myrvold's results on orthogonal triples of 10 10 Latin squares: a SAT investigation
• On propositional coding techniques for the distinguishability of objects in finite sets
• Enumeration of sets of mutually orthogonal Latin rectangles
• Enumerating extended self-orthogonal diagonal Latin squares of order up to 10
• Latin squares at Rothamsted in the time of Fisher and Yates
• Tic-Tac-Toe on an affine plane of order 4
• Finding the dimension of a non-empty orthogonal array polytope
• Parity of sets of mutually orthogonal Latin squares
• Classifying generalized Howell designs
• On the construction of triples of diagonal Latin squares of order 10
• Enumerating diagonal Latin squares of order up to 9
• The number of mates of Latin squares of sizes 7 and 8
• Pairs of MOLS of order ten satisfying non-trivial relations
• The number of labeled \(n\)-ary abelian groups and totally symmetric medial quasigroups
• Enumeration and isomorphic classification of self-orthogonal Latin squares
• Enumeration and construction of row-column designs

Describes a project that uses

Uses Software

• libexact
• Traces
• nauty

This page was built for publication: Enumeration of MOLS of small order

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2792342)