OpenAlex ·
Improved bounds on completion of partial Latin squares
- Published
- Source
- OpenAlex
- Published in
- arXiv (Cornell University)
- DOI
- 10.48550/arxiv.2609.37877
- Original
- Read it at the publisher
- Topics
Abstract
A Latin square of order $n$ is an $n \times n$ array filled with $n$ symbols so that each symbol appears exactly once in every row and column. A partial Latin square of order $n$ is an $n \times n$ array whose cells are either empty or filled in such a way that each symbol appears at most once in every row and column, and at most $n$ distinct symbols are used. In 1983, Daykin and Häggkvist conjectured that every partial Latin square in which each row and column contains at most $n/4$ symbols, and each symbol is used at most $n/4$ times, can be completed to a Latin square. We prove that every partial Latin square in which each row and column contains at most $0.231n$ symbols, and each symbol is used at most $0.231n$ times, can be completed to a Latin square, significantly improving the previous best-known bound of $0.08n$, obtained by Fu and Weng. This problem can be seen as a partite analogue of the Nash-Williams conjecture concerning triangle decompositions of dense graphs, recently proved in the breakthrough work of Delcourt and Postle. Our proof uses a `discharging' strategy, adapting the approach of Delcourt and Postle, combined with a novel method to achieve a `balancedness' property, required for the partite setting.
The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.
Read it on ReadSearch
Each opens after you create an account, and brings you back to this paper.
More in Computational Complexity
The Reach of Abelian Covers in Hypergraphs
MultiTable: A Faster Hash Table at any Physical Load Factor up to and Including One
Order-Optimal Systematic Permutation Codes for Correcting t Deletions
Quantum State Routing and Perfect State Transfer on Signed Graphs under Environmental Noise
On the nonnegativity of monomial immanants for hook partitions
Get the few papers worth your time in Computational Complexity every morning.
ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.