The number of transversals in a Latin square

Designs, Codes, and Cryptography

Volumn 40, Issue 3, 2006, Pages 269-284

  McKay, Brendan D ^a   McLeod, Jeanette C ^a   Wanless, Ian M ^a,b  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

^b MONASH UNIVERSITY   (Australia)

Author keywords

Cayley table; Latin square; n queens; Transversal; Turn square

Indexed keywords

CRYPTOGRAPHY; MATRIX ALGEBRA; NUMERICAL METHODS;

CAYLEY TABLE; LATIN SQUARE; N-QUEENS; TRANSVERSAL; TURN-SQUARE;

CODES (SYMBOLS);

EID: 33747622804     PISSN: 09251022     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10623-006-0012-8     Document Type: Article

References (28)

1. Akbari S, Alireza A (2004) Transversals and multicolored matchings. J Combin Des 12:325-332
2. Balasubramanian K (1990) On transversals in Latin squares. Linear Algebra Appl 131:125-129
3. Bedford D, Wliitaker RM (1999) Enumeration of transversals in the Cayley tables of the non-cyclic groups of order 8. Discrete Math 197/198:77-81
4. Brown JW, Parker ET (1993) More on order 10 turn-squares. Ars Combin 35:125-127
5. Cameron PJ, Wanless IM (2005) Covering radius for sets of permutations. Discrete Math 293:91-109
6. Cooper C (2000) A lower bound for the number of good permutations. Data Recording, Storage and Processing (Nat. Acad. Sci. Ukraine) 213: 15-25.
7. Cooper C, Gilchrist R, Kovalenko I, Novakovic D (2000) Deriving the number of good permutations, with application to cryptography. Cybern Syst Anal 5:10-16.
8. Cooper C, Kovalenko I (1996) The upper bound for the number of complete mappings. Theory Probab Math Statist 53:77-83.
9. Denes J, Keedwell AD (1974) Latin squares and their applications. Akademiai Kiadó, Budapest
10. Dénes J, Keedwell AD ( 1991) Latin squares: new developments in the theory and applications. Annator of Discrete Mathametics, vol. 46. North-Holland, Amsterdam
11. Derienko II (1988) On a conjecture of Brualdi (in Russian). Matlssled. No. 102, Issled. Oper, i Kvazigrupp 119:53-65
12. Fu H, Lin S (2002) The length of a partial transversal in a Latin square. J Combin Math Combin Comput 43:57-64
13. Heinrich K (1976) Latin squares composed of four disjoint subsquares. Combinatorial mathematics V. Proceedings of Fifth Australian Conference Royal Melbourne Institute of Technology, Melbourne, pp 118-127
14. Hsiang J, Shieh Y, Chen Y (2002) The cyclic complete mappings counting problems, PaPS: Problems and Problem Sets for ATP Workshop in conjunction with CADE-18 and FLoC 2002, Copenhagen, Denmark
15. Killgrove R, Roberts C, Sternfeld R, Tamez R, Derby R, Kiel D (1996) Latin squares and other configurations. Congr Numer 117:161-174
16. Kovalenko I (1996) On an upper bound for the number of complete mappings. Cybern Syst Anal 32:65-68.
17. Maenhaut BM, Wanless IM (2004) Atomic Latin squares of order eleven. J Combin Des 12:12-34
18. McKay BD, Meynert A, Myrvold W (to appear) Small Latin squares, quasigroups and loops. J Combin Des http://dx.doi.org/10.1002/jed.2005
19. McKay BD, Wanless IM (1999) Most Latin squares have many subsquares. J Combin Theory Ser A 86:323-347
20. Rivin I, Vardi I, Zimmerman P (1994) The n-queens problem. Am Math Monthly 101:629-639
21. Ryser HJ (1967) Neuere problème der Kombinatorik. Vortrage über Kombinatorik Oberwolfach 24-29:69-91
22. Shieh YP (2001) Partition Strategies for #P-complete problem with applications to enumerative combinatorics. PhD thesis, National Taiwan University
23. Shieh YP, Hsiang J, Hsu DF (2000) On the enumeration of abelian k-complete mappings. Congr Numer 144:67-88
24. Shor PW (1982) A lower bound for the length of a partial transversal in a Latin square. J Combin Theory Ser A 33:1-8
25. Thomas AD, Wood GV (1980) Group tables. Shiva Mathematics Series 2. Shiva Publishing, Nantwich
26. Vardi I (1991) Computational recreations in mathematics. Addison-Wesley, Redwood City, CA
27. Vaughan-Lee M, Wanless IM (2003) Latin squares and the Hall-Paige conjecture. Bull Lond Math Soc 35:1-5
28. Wanless IM (2002) A generalisation of transversals for Latin squares. Electron J Combin 9:R12