Enumeration of MOLS of small order

DOI10.1090/mcom/3010zbMath1332.05025arXiv1406.3681MaRDI QIDQ2792342

Ian M. Wanless, Judith Egan

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

Latin square; transversal; MOLS; plex; orthogonal mate

Mathematics Subject Classification ID

62K99: Design of statistical experiments

05B15: Orthogonal arrays, Latin squares, Room squares

05D15: Transversal (matching) theory

Related Items

Unnamed Item, Tic-Tac-Toe on an Affine Plane of order 4, Autoparatopisms of Quasigroups and Latin Squares, Integer Programming for Classifying Orthogonal Arrays, Local permutation polynomials and the action of e-Klenian groups, Enumeration of sets of mutually orthogonal Latin rectangles, Orthogonal trades and the intersection problem for orthogonal arrays, Further results on the classification of MDS codes, On the construction of triples of diagonal Latin squares 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, Parity of sets of mutually orthogonal Latin squares, The number of different reduced complete sets of MOLS corresponding to \(\mathrm{PG} (2,q)\), Enumerating extensions of mutually orthogonal Latin squares, On the non-existence of extended 1-perfect codes and MDS codes, Diagonal groups and arcs over groups, Finding the dimension of a non-empty orthogonal array polytope, On propositional coding techniques for the distinguishability of objects in finite sets, Finding the symmetry group of an LP with equality constraints and its application to classifying orthogonal arrays, Pairs of MOLS of order ten satisfying non-trivial relations, The number of labeled \(n\)-ary abelian groups and totally symmetric medial quasigroups

Uses Software

• nauty
• Traces
• libexact

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Indivisible partitions of Latin squares
• Classification algorithms for codes and designs
• Latin squares without orthogonal mates
• The existence of Latin squares without orthogonal mates
• The number of transversals in a Latin square
• Maximal difference matrices of order \(\leq 10\)
• Complete sets of pairwise orthogonal Latin squares and the corresponding projective planes
• Maximal sets of Latin squares and partial transversals
• Perfect factorisations of bipartite graphs and Latin squares without proper subrectangles
• Aspects of complete sets of \(9\times 9\) pairwise orthogonal latin squares
• The number of different reduced complete sets of MOLS corresponding to \(\mathrm{PG} (2,q)\)
• The non-existence of maximal sets of four mutually orthogonal Latin squares of order 8
• On the number of transversal designs
• Monogamous latin squares
• Practical graph isomorphism. II.
• On the number of Latin squares
• Latin Squares with Restricted Transversals
• The number of Latin squares of order 11
• Small latin squares, quasigroups, and loops
• Atomic Latin squares of order eleven
• The structure of conjugacy closed loops
• The existence and construction of two families of designs for two successive experiments
• THE 7 × 7 SQUARES
• A generalization of transversals for Latin squares