The conjecture that all cubes are stackable
Statement
Let denote the -dimensional hypercube, and call a graph stackable if, starting with one cup at each vertex, all cups can be moved onto any prescribed target vertex according to the cup-stacking rules. Cube stackability conjecture. For all , is stackable. The paper proves stackability for cubes through dimension ; the conjecture asserts that no dimension imposes an obstruction.
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.