ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let a Latin square be reduced if its first row and first column are the identity permutation. Let RnER_n^{\text{E}} and RnOR_n^{\text{O}} denote the numbers of even and odd reduced Latin squares of order nn, respectively. Reduced Latin-square parity conjecture. For all nn,

RnE−RnO≠0.R_n^{\text{E}}-R_n^{\text{O}}\neq0.

This is presented as another extension of the Alon–Tarsi conjecture for odd orders. The source attributes the proposal to work cited as Kot2011 and StWan12, but does not state a general resolution.

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.