Row-complete latin squares of every composite order exist

Journal of Combinatorial Designs

Volumn 6, Issue 1, 1998, Pages 63-77

  Higham, Jeff ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Balanced repeated measurements design; Latin square; Roman square; Row complete

Indexed keywords

EID: 0039672587     PISSN: 10638539     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1520-6610(1998)6:1<63::AID-JCD5>3.0.CO;2-U     Document Type: Article

References (17)

1. B. A. Anderson, A fast method for sequencing low order non-abelian groups, Ann. Discrete Math. 34 (1987), 27-42.
2. D. S. Archdeacon, J. H. Dinitz, D. R. Stinson, and T. W. Tillson, Some new row-complete latin squares, J. Combin. Theory Ser. A 29 (1980), 395-398.
3. B. R. Bugelski, A note on Grant's discussion of the latin square principle in the design of experiments, Psychological Bull. 46 (1949), 49-50.
4. J. Dénes and A. D. Keedwell, Latin squares and their applications, Academic Press, New York/London, 1974.
5. J. Dénes and A. D. Keedwell, "Sequenceable and R-sequenceable groups: Row-complete latin squares," Latin squares: New developments in the theory and applications, J. Dénes and A. D. Keedwell (Editors), North-Holland, Amsterdam, 1991, pp. 43-100.
6. B. Gordon, Sequences in groups with distinct partial products, Pacific J. Math. 11 (1961), 1309-1313.
7. A. Hedayat and K. Afsarinejad, Repeated measurements designs, II, Ann. Statist. 6 (1978), 619-628.
8. K. Heinrich, Pairwise orthogonal row-complete latin squares, Congr. Numer. 24 (1979), 501-510.
9. J. Higham, A product theorem for row-complete latin squares, J. Combin. Des. 5 (1997), pp. 311-318.
10. J. Higham, Construction methods for row-complete latin squares, Ph.D. thesis, University of Waterloo, Waterloo, Ontario, Canada, 1996.
11. A. D. Keedwell, "Complete mappings and sequencings of finite groups," The CRC handbook of combinatorial designs, C. J. Colbourn and J. H. Dinitz (Editors), CRC Press, Boca Raton, 1996, pp. 246-253.
12. A. D. Keedwell, On the sequenceability of non-abelian groups of order pq, Discrete Math. 37 (1981), 203-216.
13. A. D. Keedwell, "Some problems concerning complete latin squares," Combinatorics (Proc. British Combin. Conf., Aberystwyth, 1973), T. P. McDonough and V. C. Mavron (Editors), Cambridge University Press, London, 1974, pp. 89-96.
14. N. S. Mendelsohn, "Hamiltonian decomposition of the complete directed n-graph," Theory of Graphs (Proc. Colloq., Tihany, 1966), P. Erdos and J. Catona (Editors), Academic Press, New York, 1968, pp. 237-241.
15. H. Y. Song and J. H. Dinitz, "Tuscan squares," The CRC handbook of combinatorial designs, C. J. Colbourn and J. H. Dinitz (Editors), CRC Press, Boca Raton, 1996, pp. 480-484.
16. L. L. Wang, A test for the sequencing of a class of finite groups with two generators, Notices Amer. Math. Soc. 20 (1973), 73T-A275.
17. E. J. Williams, Experimental designs balanced for the estimation of residual effects of treatments, Austral. J. Sci. Res. Ser. A 2 (1949), 149-168.