Subquadratic upper bound conjecture for the longest solvable board
Statement
Let be odd, and let denote the maximal length of a solvable board of size . The paper establishes the lower bound for all and the trivial upper bound . Subquadratic upper bound conjecture. As , . 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.