no. 16 · Tuesday 17 November 2026
Height functions on the $m \times n$ Miura-ori flip graph: degree sequence and diameter
Abstract
Miura-ori is an origami grid of parallelogram faces whose creases carry mountain or valley folds. Its flip graph joins locally flat-foldable assignments differing by a legal face flip. Local flat-foldability does not require the whole sheet to fold flat. Earlier two-row formulas and small-flip counts left a uniform rectangular counting law unresolved, while the known maximum shortest-path distance left its attaining pairs unclassified. Integer face functions with adjacent values differing by one identify legal flips with local extrema and determine shortest-path distances through their differences. For a fixed number $d\ge3$ of legal flips, the assignment count on an $m\times n$ face grid with $m,n\ge2$ is a symmetric polynomial once $m,n\ge d-1$. Its degree is $d-2$ in each variable and in total, with leading part proportional to $m^{d-2}+n^{d-2}$ except at $d=4$. Exact computation identifies formulas through ten flips. For fixed $2\le m\le d-2$ and $n\ge d-1$, a finite construction gives correction polynomials of degree at most $d-3$ in $n$. At $m=d-2$, an exact linear correction involving Baxter permutations proves the threshold sharp for $d\ge4$. Computer assistance enters the four-flip total-degree proof and a cubic correction-degree bound. A sharper uniform correction-degree bound remains open. Interior-face flips first become possible with five legal flips on grids at least $3\times3$. Classifying face-function differences that maximize their minimum total absolute deviation from a constant and reconstructing every realizing assignment pair gives all farthest pairs. Outside $2\times2$, these lie among four minimum-flip assignments with two legal flips each, with four unordered pairs when one dimension is two and the other even, and two otherwise. The counts and pair classification describe available moves and maximal separation without enumerating the full flip graph.
- comments
- 89 pages, 5 figures. Consolidates arXiv:2606.22614 and arXiv:2607.05567
- fields
- Combinatorics