ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let n≥3n\geq 3 be odd, and let ML(n)ML(n) denote the maximal length of a solvable board of size nn. The paper establishes the lower bound ML(n)≥3nML(n)\geq 3n for all n≥11n\geq 11 and the trivial upper bound ML(n)≤n2ML(n)\leq n^2. Subquadratic upper bound conjecture. As n→∞n\to\infty, ML(n)=o(n2)ML(n)=o(n^2). This is explicitly presented as a weaker conjecture than the linear upper bound conjecture and would still improve the trivial quadratic 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.