← All problems

Alon–Tarsi conjecture on the parity of Latin squares

11 years old · documented by

Let LL be a Latin square of order nn, and define its sign by the product of the signs of its row and column permutations. Let EnE_n and OnO_n denote the numbers of even and odd Latin squares, respectively. Alon–Tarsi conjecture. If nn is even, then

En−On≠0,E_n-O_n\neq 0,

equivalently, the signed enumeration of Latin squares is nonzero. The conjecture remains open in general, with nontrivial cases known for several infinite families of even orders.

References

3 papers in this index state this conjecture (2014–2026). The statement above is taken from the most recent of them; the others are arXiv:2104.00838, arXiv:1412.7574.

Source: Gergely Bérczi, “Evolving Local Corrections for Global Constructions in Combinatorics”, arXiv:2603.06692 (2026).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.