Abstract
Some of the oldest combinatorial objects, whose study apparently goes back to ancient times, are the Latin squares. To obtain a Latin square, one has to fill the n 2 cells of an (n × n)-square array with the numbers 1, 2, . . . , n so that that every number appears exactly once in every row and in every column. In other words, the rows and columns each represent permutations of the set {1, . . . , n}. Let us call n the order of the Latin square. Here is the problem we want to discuss. Suppose someone started filling the cells with the numbers {1, 2, . . . , n}. At some point he stops and asks us to fill in the remaining cells so that we get a Latin square. When is this possible? In order to have a chance at all we must, of course, assume that at the start of our task any element appears at most once in every row and in every column. Let us give this situation a name. We speak of a partial Latin square of order n if some cells of an (n × n)-array are filled with numbers from the set {1, . . . , n} such that every number appears at most once in every row and column. So the problem is: When can a partial Latin square be completed to a Latin square of the same order?
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
