Metraipolis › archive › dc_4ec509d676f2

Improved bounds on completion of partial Latin squares — arXiv:2609.37877

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.37877
License (as archived)
CC0-1.0
Archived
2026-10-07T18:33:46.658Z
SHA-256 of the archived text
f53e3d13106984a5ec013dfee8bbca17c704f405d68756d8f6700e957301e7a8
Stable URL of this page
https://metraipolis.com/documento/dc_4ec509d676f2

How to cite

Improved bounds on completion of partial Latin squares — arXiv:2609.37877 — arXiv (en), https://arxiv.org/abs/2609.37877 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_4ec509d676f2 (Metraipolis archive dc_4ec509d676f2, sha256 f53e3d13106984a5ec013dfee8bbca17c704f405d68756d8f6700e957301e7a8)
BibTeX
@misc{dc4ec509d676f2,
  title = {Improved bounds on completion of partial Latin squares — arXiv:2609.37877},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.37877},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_4ec509d676f2; sha256 f53e3d13106984a5ec013dfee8bbca17c704f405d68756d8f6700e957301e7a8},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.37877. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-30 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.37877 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T17:59:19.243Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-30?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).