Skip to main content

A survey of finite embedding theorems for partial latin squares and quasigroups

Part II: Contributed Papers Expository Review Articles

  • 2326 Accesses

Part of the Lecture Notes in Mathematics book series (LNM,volume 406)

Abstract

A latin square is an n × n array such that in each row and column each of the integers 1,2,3,...,n occurs exactly once. A partial latin square is an n × n array such that in each row and column each of the integers 1,2,...,n occurs at most once. An example of a 4 × 4 partial latin square is given below.

An immediate observation shows that the partial latin square P cannot be completed to a latin square; i.e., the empty cells cannot be filled in with numbers from the set {1,2,3,4} so that the result is a latin square. This is because as soon as cell (3,4) is filled in a contradiction arises. A very obvious question to ask at this point is whether or not it is possible to complete P if we are allowed to enlarge P and introduce additional symbols. That is, does there exist an m × m latin square Q agreeing with P in its upper left hand corner? (P is said to be embedded in Q). In a by now classic paper, Trevor Evans has shown that this is always possible. In fact, Evans proved that any n × n partial latin square could be embedded in some t × t latin square for every t ≥ 2n..., the best possible result of this kind. Evans' paper is now generic. It has become the starting point for a fascinating collection of problems in the study of latin squares: the so-called finite embedding problems. It is this collection of problems that will be surveyed in this set of notes. These notes are reasonably self contained so that certain parts may be a bit pedantic..., hopefully not too much so. Examples are included at every opportunity to (hopefully) illustrate what is going on.

Keywords

  • Word Problem
  • Triple System
  • Main Diagonal
  • Empty Cell
  • Steiner Triple System

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bruck, R. H., What is a Loop? Studies in Modern Algebra (A. A. Albert, ed.), Prentice Hall, Englewood-Cliffs, N. J., (1963).

    Google Scholar 

  2. Cruse, Allen, On Embedding Incomplete Commutative Latin Squares, J. Combinatorial Theory, (to appear).

    Google Scholar 

  3. Evans, Trevor, Embeddability and the Word Problem, J. London Math. Soc., 28 (1953), 76–80.

    CrossRef  MathSciNet  MATH  Google Scholar 

  4. Evans, Trevor, Embedding Incomplete Latin Squares, Amer. Math. Monthly, 67 (1960), 958–961.

    CrossRef  MathSciNet  Google Scholar 

  5. Evans, Trevor, Finitely Presented Loops, Lattices, etc. are Hopfian, J. London Math. Soc., 44 (1969), 551–552.

    CrossRef  MathSciNet  MATH  Google Scholar 

  6. Evans, Trevor, Some Connections Between Residual Finiteness, Finite Embeddability and the Word Problems, J. London Math. Soc. (2), 1 (1969), 399–403.

    CrossRef  MathSciNet  MATH  Google Scholar 

  7. Evans, Trevor, The Word Problem for Abstract Algebras, J. London Math. Soc., 26 (1971), 64–71.

    Google Scholar 

  8. Hall, Marshall, An Existence Theorem for Latin Squares, Bull. Amer. Math. Soc., (1945), 387–388.

    Google Scholar 

  9. Hall, Marshall, A Combinational Problem on Abelian Groups, Proc. Amer. Math. Soc., 3 (1952), 584–587.

    CrossRef  MathSciNet  MATH  Google Scholar 

  10. Hilton, A. J. W., Embedding an Incomplete Diagonal Latin Square in a Complete Diagonal Latin Square, J. Combinatorial Theory, 15A (1973), 121–128.

    CrossRef  Google Scholar 

  11. Lindner, C. C., On Completing Latin Rectangles, Canad. Math. Bull., 13 (1970), 65–68.

    CrossRef  MathSciNet  MATH  Google Scholar 

  12. Lindner, C. C., Embedding Partial Idempotent Latin Squares, J. Combinatorial Theory, 10A (1971), 240–245.

    CrossRef  MathSciNet  Google Scholar 

  13. Lindner, C. C., Finite Partial Cyclic Triple Systems Can be Finitely Embedded, Algebra Universalis 1 (1971), 93–96.

    CrossRef  MathSciNet  MATH  Google Scholar 

  14. Lindner, C. C., Finite Embedding Theorems for Partial Latin Squares, Quasi-groups, and Loops, J. Combinatorial Theory, 13A (1972), 339–345.

    CrossRef  MathSciNet  Google Scholar 

  15. Marica, J. and Schönheim, Incomplete Diagonals of Latin Squares, Canad. Math. Bull., 12 (1969), 235.

    CrossRef  MathSciNet  MATH  Google Scholar 

  16. Moore, E. H., Concerning Triple Systems, Math. Ann., 43 (1893), 271–285.

    CrossRef  MathSciNet  MATH  Google Scholar 

  17. Ryser, H. J., A Combinatorial Theorem with an Application to Latin Rectangles, Proc. Amer. Math. Soc., 2 (1951), 550–552.

    CrossRef  MathSciNet  MATH  Google Scholar 

  18. Ryser, H. J., Combinational Mathematics, The Carus Mathematical Monographs, No. XIV, Math. Assoc. Amer., (1963).

    Google Scholar 

  19. Stein, S. K., On the Foundations of Quasigroups, Trans. Amer. Math. Soc., 85 (1957), 228–256.

    CrossRef  MathSciNet  MATH  Google Scholar 

  20. Treash, C., The Completion of Finite Incomplete Steiner Triple Systems with Application to Loop Theory, J. Combinatorial Theory, 10A (1971), 259–265.

    CrossRef  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1974 Springer-Verlag Berlin

About this paper

Cite this paper

Lindner, C.C. (1974). A survey of finite embedding theorems for partial latin squares and quasigroups. In: Bari, R.A., Harary, F. (eds) Graphs and Combinatorics. Lecture Notes in Mathematics, vol 406. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0066437

Download citation

  • DOI: https://doi.org/10.1007/BFb0066437

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-06854-9

  • Online ISBN: 978-3-540-37809-9

  • eBook Packages: Springer Book Archive