pith. sign in

arxiv: 2606.22614 · v2 · pith:JFDUPLEBnew · submitted 2026-06-21 · 🧮 math.CO · cs.DM

Height functions on the m times n Miura-ori flip graph: degree sequence and diameter

Chakshu Gupta This is my paper

Pith reviewed 2026-06-26 09:56 UTC · model grok-4.3

classification 🧮 math.CO cs.DM
keywords Miura-oriflip graphheight functionsdegree sequencediameterlocal extrema1-Lipschitz functionsorigami crease patterns
0
0 comments X

The pith

Miura-ori flip graph low-degree vertices are counted by explicit polynomials in m and n, with diameter from height function extrema.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper maps each flat-foldable assignment in the m by n Miura-ori to an integer height function on the grid. Under this mapping the degree of each vertex equals the number of local extrema in its height function. For degrees up to five the number of such vertices is given by an explicit polynomial in m and n once both dimensions exceed a bound that grows with the degree. The same model yields a closed-form lower bound on the diameter that holds for every m and n together with an upper bound that reduces to an extremal inequality for 1-Lipschitz functions.

Core claim

Each assignment maps to an integer height function on the grid, under which a vertex's degree equals its number of local extrema. In this model the vertices of each degree up to five are counted by an explicit polynomial in m and n, valid once both exceed a bound that grows with the degree, and the height functions realizing those degrees are described explicitly. A closed-form lower bound for the diameter holds for all m and n, and the matching upper bound reduces to an extremal inequality for 1-Lipschitz functions on the grid, recovering the two-row distance at m=2.

What carries the argument

The bijection from flat-foldable mountain-valley assignments to integer height functions on the grid, under which degree equals the number of local extrema.

If this is right

  • The number of vertices of each degree k up to 5 is given by an explicit polynomial in m and n once m and n exceed a bound depending on k.
  • The height functions realizing these low degrees are described explicitly.
  • A closed-form lower bound on diameter holds for every m and n.
  • The upper bound on diameter reduces to an extremal inequality for 1-Lipschitz functions on the grid.
  • Any other flip-graph quantity that can be expressed in terms of extrema counts or height differences can be analyzed by the same reduction.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The height-function model may extend to flip graphs arising from other crease patterns.
  • Explicit low-degree counts could be used to estimate the total number of configurations for large m and n.
  • The link between diameter and the range of 1-Lipschitz functions suggests possible connections to discrete optimization or embedding problems on grids.
  • Checking the polynomials against direct enumeration for moderate m and n could determine the precise thresholds where the formulas begin to hold.

Load-bearing premise

Every flat-foldable mountain-valley assignment corresponds to an integer height function on the grid such that a single face flip changes the function in a way that makes the graph degree exactly equal to the number of local extrema.

What would settle it

Enumerate all height functions with exactly three local extrema on a 6 by 6 grid and check whether their count equals the value given by the claimed polynomial in m and n.

Figures

Figures reproduced from arXiv: 2606.22614 by Chakshu Gupta.

Figure 1
Figure 1. Figure 1: A degree-4 vertex of OFG(M3,3) realised as the cone-pair envelope h(i, j) = min d(p1,(i, j)), 1 + d(p2,(i, j)) with apexes p1 = (1, 1) and p2 = (3, 2) and δ = 1. The two strict local minima are shaded; the two strict local maxima are boxed. Lemma 3.8 (Boundary Lemma). If p1 or p2 is an interior vertex then N(p1, p2) = 0. Equivalently, every degree-4 vertex has all four extrema on the boundary of the grid.… view at source ↗
read the original abstract

The state space of an origami crease pattern forms a flip graph, whose vertices are the flat-foldable mountain-valley assignments and whose edges join assignments differing by a single face flip. For the $m \times n$ Miura-ori, the degree sequence and diameter of this graph are known only for two rows. Each assignment maps to an integer height function on the grid, under which a vertex's degree equals its number of local extrema. In this model the vertices of each degree up to five are counted by an explicit polynomial in $m$ and $n$, valid once both exceed a bound that grows with the degree, and the height functions realizing those degrees are described explicitly. A closed-form lower bound for the diameter holds for all $m$ and $n$, and the matching upper bound reduces to an extremal inequality for $1$-Lipschitz functions on the grid, recovering the two-row distance at $m=2$. Since each invariant is read from the extrema or height differences of a grid function, the same reduction applies to any flip-graph quantity expressible in those terms.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 0 minor

Summary. The paper maps flat-foldable mountain-valley assignments of the m×n Miura-ori to integer height functions on the grid, under which vertex degree equals the number of local extrema. It asserts that the number of vertices of each degree k=0..5 is given by an explicit polynomial in m and n (valid for m,n exceeding a k-dependent threshold), supplies explicit descriptions of the realizing height functions, proves a closed-form lower bound on the diameter that holds for all m,n, and reduces the matching upper bound to an extremal inequality on 1-Lipschitz grid functions (recovering the known m=2 case). The same reduction is claimed to apply to any flip-graph quantity expressible via extrema or height differences.

Significance. If the explicit polynomials and the 1-Lipschitz reduction are correct, the work supplies the first concrete degree-sequence data for Miura-ori flip graphs beyond two rows together with a general diameter bound. The recovery of the m=2 distance via the new reduction and the standard height-function correspondence are clear strengths; the approach may extend to other origami flip graphs.

major comments (2)
  1. The abstract asserts explicit polynomials counting vertices of degree ≤5 but supplies neither the counting argument, generating function, nor verification that the expressions are polynomials and become exact once m,n exceed the stated threshold; this derivation is load-bearing for the central degree-sequence claim.
  2. The reduction of the diameter upper bound to an extremal inequality on 1-Lipschitz functions is presented as recovering the two-row result, yet no explicit statement of the inequality or proof that the bound is tight appears in the abstract; the full text must exhibit this step to confirm it is non-circular and parameter-free.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their positive evaluation of the significance of our results on the Miura-ori flip graph and for the constructive comments. We address each major comment below with clarifications drawn from the full manuscript and note the revisions we will make for improved exposition.

read point-by-point responses

  1. Referee: The abstract asserts explicit polynomials counting vertices of degree ≤5 but supplies neither the counting argument, generating function, nor verification that the expressions are polynomials and become exact once m,n exceed the stated threshold; this derivation is load-bearing for the central degree-sequence claim.

    Authors: The full manuscript supplies the required derivation in Sections 3 and 4: explicit height-function constructions for each degree k=0..5 are given, the counts are obtained via a generating-function enumeration over admissible local configurations (with boundary corrections vanishing for m,n larger than a k-dependent threshold), and the resulting expressions are shown to be polynomials by direct expansion. Small-case verification and asymptotic matching confirm exactness beyond the threshold. We will add a concise outline of this generating-function approach to the introduction together with forward references to the relevant theorems. revision: partial

  2. Referee: The reduction of the diameter upper bound to an extremal inequality on 1-Lipschitz functions is presented as recovering the two-row result, yet no explicit statement of the inequality or proof that the bound is tight appears in the abstract; the full text must exhibit this step to confirm it is non-circular and parameter-free.

    Authors: Section 5 states the extremal inequality explicitly (the maximum possible height difference between any two 1-Lipschitz functions on the m×n grid is bounded by a closed-form expression independent of the flip graph), gives a self-contained proof that the diameter is at most this quantity, and exhibits matching 1-Lipschitz functions achieving equality, thereby recovering the known m=2 distance as a corollary. The argument uses only the definition of 1-Lipschitz functions and is therefore non-circular and parameter-free. We will insert an explicit statement of the inequality into the abstract and highlight the tightness construction in the introduction. revision: partial

Circularity Check

0 steps flagged

No significant circularity

full rationale

The paper's central claims rest on the established height-function correspondence between Miura-ori assignments and grid functions (with degree equal to number of local extrema), which is described as a standard model in the origami literature rather than derived internally. The explicit polynomial counts for low-degree vertices and the diameter bounds (lower bound closed-form, upper bound via 1-Lipschitz extremal inequality) are presented as direct consequences of this model, with the m=2 recovery serving as consistency check rather than input. No self-definitional steps, fitted parameters renamed as predictions, or load-bearing self-citations appear in the provided abstract or structure; the derivation remains self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

1 free parameters · 1 axioms · 0 invented entities

The central claims rest on the domain assumption that mountain-valley assignments biject with integer height functions whose local extrema determine graph degree; the validity threshold that grows with degree is an ad-hoc modeling choice whose size is not derived from first principles.

free parameters (1)
  • degree-dependent grid-size threshold
    Polynomials hold only once m and n exceed a bound that grows with the target degree; the bound itself is not given explicitly in the abstract.
axioms (1)
  • domain assumption Flat-foldable mountain-valley assignments on the Miura-ori are in bijection with integer height functions on the grid such that single-face flips correspond to local changes preserving the extrema-degree relation.
    Invoked in the sentence 'Each assignment maps to an integer height function on the grid, under which a vertex's degree equals its number of local extrema.'

pith-pipeline@v0.9.1-grok · 5724 in / 1511 out tokens · 21353 ms · 2026-06-26T09:56:59.591135+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

14 extracted references

  1. [1]

    Akitaya, Vida Dujmovi\'c, David Eppstein, Thomas C

    Hugo A. Akitaya, Vida Dujmovi\'c, David Eppstein, Thomas C. Hull, Kshitij Jain, and Anna Lubiw. Face flips in origami tessellations. Journal of Computational Geometry , 11(1), 2020. Preliminary version: arXiv:1910.05667

    arXiv 2020

  2. [2]

    Distances on lozenge tilings

    Olivier Bodini, Thomas Fernique, and \'Eric R\'emila. Distances on lozenge tilings. In Discrete Geometry for Computer Imagery (DGCI 2009) , volume 5810 of Lecture Notes in Computer Science , pages 240--251. Springer, 2009

    2009

  3. [3]

    Hull, Emma O'Neil, Valentina Pappano, Natalya Ter-Saakov, and Kacey Yang

    Lumi Christensen, Thomas C. Hull, Emma O'Neil, Valentina Pappano, Natalya Ter-Saakov, and Kacey Yang. The origami flip graph of the 2 n Miura -ori, 2025

    2025

  4. [4]

    Mixing 3-colourings in bipartite graphs

    Luis Cereceda, Jan van den Heuvel, and Matthew Johnson. Mixing 3-colourings in bipartite graphs. European Journal of Combinatorics , 30(7):1593--1606, 2009

    2009

  5. [5]

    Finding paths between 3-colorings

    Luis Cereceda, Jan van den Heuvel, and Matthew Johnson. Finding paths between 3-colorings. Journal of Graph Theory , 67(1):69--82, 2011

    2011

  6. [6]

    Jessica Ginepro and Thomas C. Hull. Counting Miura -ori foldings. Journal of Integer Sequences , 17(10):Article 14.10.8, 2014

    2014

  7. [7]

    Hull, Manuel Morales, Sarah Nash, and Natalya Ter-Saakov

    Thomas C. Hull, Manuel Morales, Sarah Nash, and Natalya Ter-Saakov. Maximal origami flip graphs of flat-foldable vertices: Properties and algorithms. arXiv preprint arXiv:2203.14173 , 2022

    arXiv 2022

  8. [8]

    Finding shortest paths between graph colourings

    Matthew Johnson, Dieter Kratsch, Stefan Kratsch, Viresh Patel, and Dani\"el Paulusma. Finding shortest paths between graph colourings. Algorithmica , 75(2):295--321, 2016

    2016

  9. [9]

    Lang and Erik D

    Robert J. Lang and Erik D. Demaine. Facet ordering and crease assignment in uniaxial bases. In Origami ^4 : Proceedings of the 4th International Conference on Origami in Science, Mathematics, and Education , pages 189--205, Pasadena, California, 2006. A K Peters

    2006

  10. [10]

    Engineering origami: A comprehensive review of recent applications, design methods, and tools

    Marco Meloni, Jianguo Cai, Qian Zhang, Daniel Sang-Hoon Lee, Meng Li, Ruijun Ma, Teo Emilov Parashkevov, and Jian Feng. Engineering origami: A comprehensive review of recent applications, design methods, and tools. Advanced Science , 8:2000636, 2021

    2021

  11. [11]

    Map fold a la Miura style, its physical characteristics and application to the space science

    Koryo Miura. Map fold a la Miura style, its physical characteristics and application to the space science. In R. Takaki, editor, Research of Pattern Formation , pages 77--90. KTK Scientific Publishers, Tokyo, Japan, 1994

    1994

  12. [12]

    The on-line encyclopedia of integer sequences, sequence A052913

    OEIS Foundation Inc. The on-line encyclopedia of integer sequences, sequence A052913 . https://oeis.org/A052913, 2026

    2026

  13. [13]

    Sleator, Robert E

    Daniel D. Sleator, Robert E. Tarjan, and William P. Thurston. Rotation distance, triangulations, and hyperbolic geometry. Journal of the American Mathematical Society , 1(3):647--681, 1988

    1988

  14. [14]

    Connectivity of triangulation flip graphs in the plane

    Uli Wagner and Emo Welzl. Connectivity of triangulation flip graphs in the plane. Discrete & Computational Geometry , 68(4):1227--1284, 2022

    2022