ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let L\mathbf{L} be a uniformly random n×nn\times n Latin square, and let Nrow(L)N_{\mathrm{row}}(\mathbf{L}) denote the number of odd row permutations of L\mathbf{L}. Cameron's conjecture. As n→∞n\to\infty, the distribution of Nrow(L)N_{\mathrm{row}}(\mathbf{L}) is approximately the binomial distribution Bin⁡(n,1/2)\operatorname{Bin}(n,1/2). This conjecture formalizes the idea that the row parities of a random Latin square behave like nn independent fair coin flips. The Alon--Tarsi conjecture would then hold only just barely, while the precise meaning and validity of this asymptotic approximation remain open.

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.