Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
article

3-Homogeneous latin trades

Published: 01 September 2005 Publication History

Abstract

Let T be a partial latin square and L be a latin square with T@?L. We say that T is a latin trade if there exists a partial latin square T^' with T^'@?T=@A such that (L@?T)@?T^' is a latin square. A k-homogeneous latin trade is one which intersects each row, each column and each entry either 0 or k times. In this paper, we construct 3-homogeneous latin trades from hexagonal packings of the plane with circles. We show that 3-homogeneous latin trades of size 3m exist for each m>=3. This paper discusses existence results for latin trades and provides a glueing construction which is subsequently used to construct all latin trades of finite order greater than three.

References

[1]
Bate, J.A. and van Rees, G.H.J., Minimal and near-minimal critical sets in back circulant latin squares. Austral. J. Combin. v27. 47-61.
[2]
Cavenagh, N.J., Latin trade algorithms and the smallest critical set in a latin square. J. Automat. Languages Combin. v8. 567-578.
[3]
Cavenagh, N.J., The size of the smallest latin trade in a back circulant latin square. Bull. Inst. Combin. Appl. v38. 11-18.
[4]
Cavenagh, N.J., Embedding 3-homogeneous latin trades into abelian 2-groups. Comment. Math. Univ. Carolin. v45. 191-212.
[5]
N.J. Cavenagh, The size of the smallest critical set in the back circulant latin square, submitted for publication.
[6]
N.J. Cavenagh, D. Donovan, A. Drápal, 4-homogeneous latin trades, Austral. J. Combin. 32 (2005) 285-303.
[7]
N.J. Cavenagh, D. Donovan, A. Khodkar, On the spectrum of critical sets in back circulant latin squares, Ars Combin., to appear.
[8]
Conway, J.C. and Sloane, N.J., Sphere Packings, Lattices and Groups. 1998. Springer, New York.
[9]
Donovan, D., Howse, A. and Adams, P., A discussion of latin interchanges. J. Combin. Math. Combin. Comput. v23. 161-182.
[10]
Donovan, D. and Mahmoodian, E.S., An algorithm for writing any latin interchange as the sum of intercalates. Bull. Inst. Combin. Appl. v34. 90-98.
[11]
Drápal, A., On a planar construction of quasigroups. Czechoslovak Math. J. v41. 538-548.
[12]
Drápal, A. and Kepka, T., Exchangeable groupoids I. Acta Univ. Carolin.-Math. Phys. v24. 57-72.
[13]
Drápal, A. and Kepka, T., On a distance of groups and latin squares. Comment. Math. Univ. Carolin. v30. 621-626.
[14]
A.S. Hedayat, The theory of trade-off for t-designs, in: Coding theory and design theory, Part II, IMA Volumes in Mathematics and its Applications, vol. 21, Springer, New York, 1990.
[15]
Horak, P., Aldred, R.E.L. and Fleischner, H., Completing Latin squares: critical sets. J. Combin. Des. v10. 419-432.
[16]
Khosrovshahi, G.B., Maimani, H.R. and Torabi, R., On trades: an update. Discrete Appl. Math. v95. 361-376.
[17]
Street, A.P., Trades and defining sets. In: Colbourn, C.J., Dinitz, J.H. (Eds.), CRC Handbook of Combinatorial Designs, CRC Press, Boca Raton, FL. pp. 474-478.

Cited By

View all

Index Terms

  1. 3-Homogeneous latin trades
    Index terms have been assigned to the content through auto-classification.

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    Publisher

    Elsevier Science Publishers B. V.

    Netherlands

    Publication History

    Published: 01 September 2005

    Author Tags

    1. Circle packing
    2. Latin square
    3. Latin trade

    Qualifiers

    • Article

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)0
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 06 Oct 2024

    Other Metrics

    Citations

    Cited By

    View all

    View Options

    View options

    Get Access

    Login options

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media