ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let m≥nm\ge n. A ν\nu-chain is a sequence of integers arising from the successive sizes of a monotone chain of order ideals in the m×nm\times n grid, where ν\nu is the associated size-growth function; the antidiagonal chain is the chain obtained by adding cells along successive antidiagonals. Let D(m,n)D(m,n) denote the value attained by the antidiagonal chain.

Slowest-chain conjecture. Among all ν\nu-chains, the antidiagonal chain maximises

∑ℓmin⁡(cℓ, mn−cℓ),\sum_\ell\min(c_\ell,\,mn-c_\ell),

with maximum value D(m,n)D(m,n).

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 D(m,n)D(m,n). Exhaustive enumeration confirms it through 5×45\times4; 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 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.