# Atomic Latin squares of order eleven

Maenhaut, B. M. and Wanless, I. M. (2004) Atomic Latin squares of order eleven. Journal of Combinatorial Designs, 12 1: 12-34. doi:10.1002/jcd.10064

Author Maenhaut, B. M.Wanless, I. M. Atomic Latin squares of order eleven Journal of Combinatorial Designs   Check publisher's open access policy 1063-8539 2004-01-01 2004 Article (original research) 10.1002/jcd.10064 12 1 12 34 23 Colbourn, C. United States of America John Wiley & sons, Inc eng 230101 Mathematical Logic, Set Theory, Lattices And CombinatoricsC1780101 Mathematical sciences A Latin square is pan-Hamiltonian if the permutation which defines row i relative to row j consists of a single cycle for every i j. A Latin square is atomic if all of its conjugates are pan-Hamiltonian. We give a complete enumeration of atomic squares for order 11, the smallest order for which there are examples distinct from the cyclic group. We find that there are seven main classes, including the three that were previously known. A perfect 1-factorization of a graph is a decomposition of that graph into matchings such that the union of any two matchings is a Hamiltonian cycle. Each pan-Hamiltonian Latin square of order n describes a perfect 1-factorization of Kn,n, and vice versa. Perfect 1-factorizations of Kn,n can be constructed from a perfect 1-factorization of Kn+1. Six of the seven main classes of atomic squares of order 11 can be obtained in this way. For each atomic square of order 11, we find the largest set of Mutually Orthogonal Latin Squares (MOLS) involving that square. We discuss algorithms for counting orthogonal mates, and discover the number of orthogonal mates possessed by the cyclic squares of orders up to 11 and by Parker's famous turn-square. We find that the number of atomic orthogonal mates possessed by a Latin square is not a main class invariant. We also define a new sort of Latin square, called a pairing square, which is mapped to its transpose by an involution acting on the symbols. We show that pairing squares are often orthogonal mates for symmetric Latin squares. Finally, we discover connections between our atomic squares and Franklin's diagonally cyclic self-orthogonal squares, and we correct a theorem of Longyear which uses tactical representations to identify self-orthogonal Latin squares in the same main class as a given Latin square. Latin squarestactical representationself-orthogonal Latin squaresorthogonal arraysdiagonally-cyclic Latin squaresmutually orthogonal Latin squaresperfect 1-factorizations C1 UQ

 Document type: Journal Article Article (original research) Excellence in Research Australia (ERA) - Collection 2005 Higher Education Research Data Collection School of Physical Sciences Publications

 Versions Version Filter Type Sat, 21 Jan 2017, 08:06:37 EST Wed, 04 Oct 2017, 23:36:14 EST Sun, 15 Oct 2017, 23:46:31 EST Sun, 12 Nov 2017, 14:46:08 EST Tue, 19 Dec 2017, 15:21:38 EST Filtered Full
Citation counts: Cited 17 times in Thomson Reuters Web of Science Article | Citations Cited 17 times in Scopus Article | Citations Search Google Scholar Tue, 20 Mar 2007, 00:40:16 EST by Mrs Leith Woodall on behalf of School of Mathematics & Physics