ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let L(2n)L(2^n) be the Latin square of order 2n2^n, with n≥4n\geq 4, and let CC be a critical set of minimal size in L(2n)L(2^n). Writing SS for this critical set, so that ∣S∣=∣C∣|S|=|C|, the minimal critical-set bound conjecture.

121⋅4n−4≤∣S∣≤5n−1.121\cdot 4^{n-4}\leq |S|\leq 5^{n-1}.

These bounds are motivated by computational results for L(16)L(16), L(32)L(32), and L(64)L(64) and by the difficulty of determining optimal critical sets and unique completions. The source does not provide a resolution of the conjectured bound.

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.