Residual-bias involution principle for the Alon–Tarsi conjecture
Statement
Let be the set of Latin squares of even order , let be the standard Alon–Tarsi sign, and let be a residual set. Residual-bias involution principle. For each even , there exists a deterministic scan order of two-line cycle trades and a deterministic stability rule such that the induced map is an involution and
for every , where is nonempty and has nonzero signed sum, for instance . 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.