ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Ln\mathcal{L}_n be the set of Latin squares of even order nn, let sgn⁡(L)\operatorname{sgn}(L) be the standard Alon–Tarsi sign, and let Res⁡n\operatorname{Res}_n be a residual set. Residual-bias involution principle. For each even nn, there exists a deterministic scan order Sn\mathcal{S}_n of two-line cycle trades and a deterministic stability rule such that the induced map Fn:Ln→LnF_n:\mathcal{L}_n\to\mathcal{L}_n is an involution and

sgn⁡(Fn(L))=−sgn⁡(L)\operatorname{sgn}(F_n(L))=-\operatorname{sgn}(L)

for every L∈Ln∖Res⁡nL\in\mathcal{L}_n\setminus\operatorname{Res}_n, where Res⁡n\operatorname{Res}_n is nonempty and has nonzero signed sum, for instance ∑L∈Res⁡nsgn⁡(L)=±∣Res⁡n∣\sum_{L\in\operatorname{Res}_n}\operatorname{sgn}(L)=\pm|\operatorname{Res}_n|. Consequently, the signed enumeration of Latin squares is nonzero. This would prove the Alon–Tarsi conjecture at every even order, but the supplied text gives only an experimentally suggested principle and no proof.

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.