Name
Abstract | ||
|---|---|---|
An n x n (partial) Latin array L is an array in which no symbol appears more than once in any row or column; this differs from a (partial) Latin square in that L may have up to n(2) distinct symbols present. We say L is k-completable if there exists a partition of the symbols of L into k parts so that the corresponding induced subarrays are each completable partial Latin squares. In 2015 Kuhl and Schroeder demonstrated the existence of n x n partial Latin arrays which are not k-completable for each k < n, and in this paper, we show that all n x n partial Latin arrays are n-completable. This addresses a conjecture by Kuhl and Schroeder and also confirms a special case of a conjecture by Haggkvist. |
Year | Venue | DocType |
|---|---|---|
2022 | AUSTRALASIAN JOURNAL OF COMBINATORICS | Journal |
Volume | ISSN | Citations |
83 | 2202-3518 | 0 |
PageRank | References | Authors |
0.34 | 0 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kevin Akers | 1 | 0 | 0.34 |
| Stacie Baumann | 2 | 0 | 0.34 |
| Sarah Gustafson | 3 | 0 | 0.34 |
| Jaromy Kuhl | 4 | 10 | 4.72 |
| Olivia Mosrie | 5 | 0 | 0.34 |
| Michael W. Schroeder | 6 | 0 | 0.34 |