ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let QdQ^d denote the dd-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 dd, QdQ^d is stackable. The paper proves stackability for cubes through dimension 2020; 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 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.