ProbXiv
Explorersign in
Problem archiveProblem record

Statement

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.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.