ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let nn be a positive integer. A Latin square of order nn is an n×nn\times n array with entries in [n]={1,…,n}[n]=\{1,\ldots,n\}, in which every element occurs precisely once in each row and each column. Its sign is the product of the signs of the 2n2n row and column permutations; let ELS(n)\mathrm{ELS}(n) and OLS(n)\mathrm{OLS}(n) denote the numbers of even and odd Latin squares, respectively. Alon and Tarsi's Latin square conjecture. If nn is even, then ELS(n)≠OLS(n)\mathrm{ELS}(n)\ne\mathrm{OLS}(n). The conjecture is a well-known reformulation-related statement connected in the source to Rota's basis conjecture; the supplied text gives no evidence that it has been resolved.

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.