Slowest-chain conjecture for the Miura-ori flip graph
Statement
Let . A -chain is a sequence of integers arising from the successive sizes of a monotone chain of order ideals in the grid, where is the associated size-growth function; the antidiagonal chain is the chain obtained by adding cells along successive antidiagonals. Let denote the value attained by the antidiagonal chain.
Slowest-chain conjecture. Among all -chains, the antidiagonal chain maximises
with maximum value .
This conjecture would imply that the antidiagonal chain gives the largest possible displacement and hence that the diameter of the Miura-ori flip graph equals . Exhaustive enumeration confirms it through ; a general proof remains open.
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.