Small Latin squares, quasigroups, and loops

Journal of Combinatorial Designs

Volumn 15, Issue 2, 2007, Pages 98-119

  McKay, Brendan D ^a   Meynert, Alison ^b,c   Myrvold, Wendy ^b  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

^b UNIVERSITY OF VICTORIA   (Canada)

^c EUROPEAN BIOINFORMATICS INSTITUTE   (United Kingdom)

Author keywords

Isotopy; Latin square; Loop; Main class; Orthogonal; Quasigroup

Indexed keywords

EID: 33847786535     PISSN: 10638539     EISSN: 15206610     Source Type: Journal    
DOI: 10.1002/jcd.20105     Document Type: Article

References (55)

1. D. M. Acketa and S. Matić-Kekić, An attempt for construction of a triple of pairwise mutually orthogonal Latin squares on 10 elements, Zb Rad Prirod-Mat Fak Ser Mat 25 (1995), 141-153.
2. A. A. Albert, Quasigroups. II., Trans Amer Math Soc 55 (1944), 401-419.
3. V. L. Arlazarov, A. M. Baraev, Ya. Yu. Gol'fand, and I. A. Faradžev, Construction with the aid of a computer of all Latin squares of order 8 (Russian), Algorithmic investigations in combinatoric (Moscow, Nauka, 1978), pp. 129-141, 187.
4. S. E. Bammel and J. Rothstein, The number of 9 ?9 Latin squares, Discrete Math 11 (1975), 93-95.
5. R. C. Bose and S. S. Shrikhande, On the falsity of Euler's conjecture about the non-existence of two orthogonal Latin squares of order 4t + 2, Proc Nat Acad Sci USA 45 (1959), 734-737.
6. R. C. Bose, S. S. Shrikhande, and E. T. Parker, Further results on the construction of mutually orthogonal Latin squares and the falsity of Euler's conjecture, Can J Math 12 (1960), 189-203.
7. C. G. Bower, Private communication (2000).
8. L. J. Brant and G. L. Mullen, A note on isomorphism classes of reduced Latin squares of order 7, Utilitas Math 27 (1985), 261-263.
9. A. E. Brouwer, Four MOLS of order 10 with a hole of order 2, J Statist Plann Inference 10 (1984), 203-205.
10. J. W. Brown, Enumeration of Latin squares with application to order 8, J Combin Theory 5 (1968), 177-184.
11. J. W. Brown, An extension of Mann's theorem to a triple of mutually orthogonal Latin squares of order 10, J Combin Theory Ser A 12 (1972), 316-318.
12. J. W. Brown and E. T. Parker, A try for three order-10 orthogonal Latin squares, Congr Numer 36 (1982), 143-144.
13. J.W. Brown and E. T. Parker, Some attempts to construct orthogonal Latin squares, Congr Numer 43 (1984), 201-202.
14. J.W. Brown and E. T. Parker, An attempt to construct three mols ?10 with a common transversal, Algebras Groups Geom 2 (1985), 258-262.
15. J. W. Brown and E. T. Parker, More on order 10 turn-squares, Ars Combin 35 (1993), 125-127.
16. A. Cayley, On Latin squares, Oxford Camb Dublin Messenger Math 19 (1890), 85-239.
17. C. J. Colbourn and J. H. Dinitz (Editors), The CRC Handbook of Combinatorial Designs. CRC Press Series on Discrete Mathematics and its Applications. CRC Press, Boca Raton, FL, 1996, 753.
18. C. J. Colbourn and J. H. Dinitz, Mutually orthogonal Latin squares: A brief survey of constructions, J Statist Plann Inference 95 (2001), 9-48.
19. A. Cruse, On embedding incomplete symmetric latin squares, J Comb Theory Ser A, 16 (1974), 18-22.
20. J. Dénes and A. D. Keedwell, Latin Squares and their Applications, Academic Press, New York-London, 1974.
21. L. Euler, Recherches sur une nouvelle espèce de quarrés magiques, Verhandelingen/uitgegeven door het zeeuwsch Genootschap der Wetenschappen te Vlissingen 9 (1782), 85-239.
22. I. A. Faradžev, Constructive enumeration of combinatorial objects. Problèmes combinatoires et théorie des graphes, Colloq. Internat. CNRS, Univ. Orsay, Orsay, 1976, (CNRS Paris, 1978) pp. 131-135.
23. R. A. Fisher and F. Yates, The 6 ×6 Latin squares, Proc Cambridge Philos Soc, 30 (1934), 492-507.
24. M. Frolov, Sur les permutations carrées, J de Math spéc IV (1890), 8-11, 25-30.
25. P. Guérin, Private communication (2001).
26. S. M. Jacob, The enumeration of the Latin rectangle of depth three by means of a formula of reduction, with other theorems relating to non-clashing substitutions and Latin squares, Proc London Math Soc 31 (1930), 329-354.
27. M. T. Jacobson and P. Matthews, Generating uniformly distributed random Latin squares, J Combin Des 4 (1996), 405-437.
28. G. Kolesova, C. W. H. Lam, and L. Thiel, On the number of 8 ?8 Latin squares, J Combin Theory Ser A, 54 (1990), 143-148.
29. C. W. H. Lam, L. Thiel, and S. Swiercz, The nonexistence of finite projective planes of order 10, Can J Math 41 (1989), 1117-1123.
30. P. A. MacMahon, Combinatory Analysis, Cambridge University Press, Cambridge, 1915.
31. B. M. Maenhaut and I. M. Wanless, Atomic Latin squares of order eleven, J Combin Des 12 (2004), 12-34.
32. B. D. McKay, nauty graph isomorphic software, available at http://cs.anu.edu.au/~bdm/nauty.
33. B. D. McKay, Isomorph-free exhaustive generation, J Algorithms, 26 (1998), 306-324; also errata at http://cs.anu.edu.au/~bdm/publications.
34. B. D. McKay and E. Rogoyski, Latin squares of order ten, Electron J Combin 2 (1995), #N3 (4 pp).
35. B. D. McKay and I. M. Wanless, On the number of Latin squares, Ann Combin 9 (2005), 335-344.
36. W. Myrvold, Negative results for orthogonal triples of Latin squares of order 10, J Combin Math Combin Comput 29 (1999), 95-105.
37. A. V. Nazarok, One more attempt to construct POLS(10,3) (Russian), Asymptotic methods in problems in the theory of random evolutions, Akad. Nauk Ukrain. SSR Inst Mat, Kiev (1991), pp. 89-93.
38. P. M. Neumann, A lemma that is not Burnside's, Math Sci 4 (1979), 133-141.
39. H. W. Norton, The 7×7 squares, Ann Eugenics 9 (1939), 269-307.
40. E. T. Parker, Orthogonal latin squares, Proc Nat Acad Sci USA 45 (1959), 859-862.
41. E. T. Parker, Computer investigation of orthogonal Latin squares of order ten, Proc Sympos Appl Math Vol XV, (Amer Math Soc, 1963) pp. 73-81.
42. E. T. Parker, Nonexistence of a triple of orthogonal Latin squares of order 10 with group of order 25-A search made short, J Combin Theory Ser A, 19 (1975), 243-244.
43. D. A. Preece, Classifying Youden rectangles, J Royal Stat Soc Series B (Meth) 28 (1966), 118-130.
44. QSCGZ (pseudonym), Anonymous electronic posting to "loopforum", October 2001. http://groups.yahoo.com/group/loopforum/
45. R. C. Read, Every one a winner, Annals Discrete Math 2 (1978), 107-120.
46. A. Sade, Enumération des carrés latins. Application au 7ème ordre. Conjectures pour les ordres supérieurs, privately published, Marseille, 1948, 8 p.
47. A. Sade, An omission in Norton's list of 7 ×7 squares, Ann Math Stat 22 (1951), 306-307.
48. A. Sade, Morphismes de quasigroupes. Tables, Univ Lisboa Revista Fac Ci A 13 (1970/71), 149-172.
49. P. N. Saxena, A simplified method of enumerating Latin squares by MacMahon's differential operators; II. The 7 ×7 Latin squares, J Indian Soc Agric Statistics 3 (1951), 24-79.
50. E. Schönhardt, Über lateinische Quadrate und Unionen, J Reine Angew Math 163 (1930), 183-230.
51. J. Y. Shao andW. D.Wei, A formula for the number of Latin squares, Discrete Math 110 (1992), 293-296.
52. S. S. Shrikhande, A note on mutually orthogonal Latin squares, Sankhyā Ser A, 23 (1961), 115-116.
53. G. Tarry, Le problème des 36 officiers, Ass Franç Paris 29 (1900), 170-203.
54. I. M. Wanless, Answers to questions by Dénes on Latin power sets, Eur J Combin 22 (2001), 1009-1020.
55. M. B. Wells, The number of Latin squares of order eight, J Combin Theory 3 (1967), 98-99.