Hostname: page-component-586b7cd67f-rdxmf Total loading time: 0 Render date: 2024-11-25T03:24:11.918Z Has data issue: false hasContentIssue false
  • English
  • Français

Incomplete Diagonals of Latin Squares

Published online by Cambridge University Press:  20 November 2018

J. Marica  and
J. Schönheim
J. Marica
Affiliation:
University of Calgary, Calgary, Alberta
J. Schönheim
Affiliation:
University of Calgary, Calgary, Alberta
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

The following question has been asked by J. Dénes [2]: If n - 1 elements of the diagonal of an n × n array are prescribed, is it possible to complete the array to form an n × n latin square?" It is known that if n diagonal elements are given such a completion is not always possible.

That the answer to Dénes' question is yes follows directly from a theorem of M. Hall Jr. [1].

Type
Research Article
Information
Canadian Mathematical Bulletin , Volume 12 , Issue 2 , April 1969 , pp. 235
Copyright
Copyright © Canadian Mathematical Society 1969

References

1. Hall, M. Jr, A combinatorial problem on abelian groups. Proc. Amer. Math. Soc. 3 (1952) 584–587.Google Scholar
2. Dénes, J., Lecture at University of Surrey, 1967.Google Scholar