On the number of transversals in Cayley tables of cyclic groups

Discrete Applied Mathematics

Volumn 158, Issue 2, 2010, Pages 136-146

  Cavenagh, Nicholas J ^a,b   Wanless, Ian M ^a  

^a MONASH UNIVERSITY   (Australia)

^b UNIVERSITY OF WAIKATO   (New Zealand)

Author keywords

Complete mapping; Diagonally cyclic; Homogeneous latin bitrade; Latin square; Magic juggling sequence; Orthomorphism; Random MOLS; Semi queen; Transversal

Indexed keywords

COMPLETE MAPPING; DIAGONALLY CYCLIC; HOMOGENEOUS LATIN BITRADE; LATIN SQUARE; MAGIC JUGGLING SEQUENCE; ORTHOMORPHISM; RANDOM MOLS; SEMI-QUEEN; TRANSVERSAL;

MAPPING;

RECREATIONAL FACILITIES;

EID: 70449535538     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2009.09.006     Document Type: Article

References (36)

1. Bailey R.A. Strata for randomized experiments. J. Roy. Statist. Soc. Ser. B 53 (1991) 27-78
2. Bean R., Bidkhori H., Khosravi M., and Mahmoodian E.S. k-homogeneous latin trades. Bayreuth. Math. Schr. 74 (2005) 7-18
3. Bebeacua C., Mansour T., Postnikov A., and Severini S. On the X-rays of permutations. Electron. Notes Discrete Math. 20 (2005) 193-203
4. Bagheri Gh Behrooz, E.S. Mahmoodian, On the existence of k-homogeneous latin bitrades, Util. Math. (in press)
5. Bender E.A. Asymptotic methods in enumeration. SIAM Rev. 16 (1974) 485-515
6. Cavenagh N.J. The theory and application of latin bitrades: A survey. Math. Slovac. 58 (2008) 1-28
7. Cavenagh N.J., Donovan D., and Drápal A. 3-homogeneous latin trades. Discrete Math. 300 (2005) 57-70
8. Cavenagh N.J., Donovan D., and Drápal A. 4-homogeneous latin trades. Australas. J. Combin. 32 (2005) 285-303
9. Cavenagh N.J., Greenhill C., and Wanless I.M. The cycle structure of two rows in a random latin square. Random Structures Algorithms 33 (2008) 286-309
10. Cavenagh N., Hämäläinen C., and Drápal A. Latin trades derived from groups. Discrete Math. 308 (2008) 6189-6202
11. Cavenagh N., Hämäläinen C., and Nelson A. On completing three cyclically generated transversals to a latin square. Finite Fields Appl. 15 (2009) 294-303
12. Cooper C., Gilchrist R., Kovalenko I., and Novakovic D. Estimation of the number of good permutations, with applications to cryptography. Cybernet. Systems Anal. 35 (1999) 688-693
13. Cooper C., and Kovalenko I. The upper bound for the number of complete mappings. Theory Probab. Math. Statist. 53 (1996) 77-83
14. Grüttmüller M. Completing partial latin squares with two cyclically generated prescribed diagonals. J. Combin. Theory Ser. A 103 (2003) 349-362
15. Häggkvist R., and Janssen J.C.M. All-even latin squares. Discrete Math. 157 (1996) 199-206
16. Jacobson M.T., and Matthews P. Generating uniformly distributed random latin squares. J. Combin. Des. 4 (1996) 405-437
17. Kovalenko I.N. Upper bound on the number of complete maps. Cybernet. Systems Anal. 32 (1996) 65-68
18. Yu N. Kuznetsov, Applying fast simulation to find the number of good permutations. Cybernet. Systems Anal. 43 (2007) 830-837
19. Kuznetsov N.Yu. Estimating the number of good permutations by a modified fast simulation method. Cybernet. Systems Anal. 44 (2008) 547-554
20. Kuznetsov N.Yu. Estimating the number of latin rectangles by the fast simulation method. Cybernet. Systems Anal. 45 (2009) 69-75
21. Maenhaut B.M., and Wanless I.M. Atomic latin squares of order eleven. J. Combin. Des. 12 (2004) 12-34
22. McKay B.D., McLeod J.C., and Wanless I.M. The number of transversals in a latin square. Des. Codes. Cryptogr. 40 (2006) 269-284
23. McKay B.D., and Wanless I.M. Most latin squares have many subsquares. J. Combin. Theory. Ser. A 86 (1999) 323-347
24. McKay B.D., and Wanless I.M. On the number of latin squares. Ann. Comb. 9 (2005) 335-344
25. Odlyzko A.M. Asymptotic enumeration methods. Handbook of Combinatorics (1995), Elsevier, Amsterdam 1063-1229
26. Polster B. The mathematics of Juggling (2003), Springer-Verlag, New York
27. Rivin I., Vardi I., and Zimmerman P. The n-queens problem. Amer. Math. Monthly 101 (1994) 629-639
28. Singer B.H., and Pincus S. Irregular arrays and randomization. Proc. Natl. Acad. Sci. USA 95 (1998) 1363-1368
29. N.J.A. Sloane, The On-Line Encyclopedia of Integer Sequences, http://www.research.att.com/~njas/sequences/
30. K. Stamatiou, J.G. Proakis, A performance analysis of coded frequency-hopped OFDMA, in: IEEE Wireless Communications and Networking Conference, WCNC, v2, (2005) pp. 1132-1137
31. D.S. Stones, I.M. Wanless, A congruence connecting latin rectangles and partial orthomorphisms (submitted for publication)
32. D.S. Stones, I.M. Wanless, Compound orthomorphisms of the cyclic group (submitted for publication)
33. I. Vardi, Computational recreations in mathematics, Addison-Wesley, Redwood City, CA
34. Wanless I.M. Diagonally cyclic Latin squares. European J. Combin. 25 (2004) 393-413
35. Wanless I.M. Transversals in latin squares. Quasigroups Related Systems 15 (2007) 169-190
36. Open problems from Workshop on latin trades Prague, 6-10 Feb 2006. http://www.karlin.mff.cuni.cz/~rozendo/op.html