pith. sign in

arxiv: 2605.24328 · v1 · pith:WH2JK4SFnew · submitted 2026-05-23 · 🧮 math.CO

Framing Triangulations for Arbitrary Integer Flow Polytopes

Jonah Berggren This is my paper

Pith reviewed 2026-06-30 13:43 UTC · model grok-4.3

classification 🧮 math.CO
keywords framing triangulationsinteger flow polytopesunimodular triangulationswell-ordered triangulationsCatalan combinatoricsCambrian combinatoricsvolume formulash*-polynomials
0
0 comments X

The pith

A theory of unimodular framing triangulations extends to arbitrary integer flow polytopes.

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

The paper develops the first general theory of unimodular framing triangulations that works for any integer flow polytope rather than only unit flow polytopes. Earlier studies linked these triangulations to generalizations of Catalan and Cambrian combinatorics and produced volume and h*-polynomial formulas, yet those results remained confined to the unit case except for two recent special non-unit classes. The work identifies pathologies that appear in unrestricted general examples and cannot occur for unit polytopes. It responds by defining a subclass of well-ordered framing triangulations expected to retain the key properties while still covering every framing triangulation setting already in the literature.

Core claim

We introduce the first theory of (unimodular) framing triangulations for arbitrary integer flow polytopes. We will observe some pathologies in general examples which are impossible in the unit case, and propose in response a class of "well-ordered" framing triangulations which we expect to inherit key properties from the unit case while still containing all settings of framing triangulations existing in the literature.

What carries the argument

well-ordered framing triangulations, a proposed subclass of unimodular triangulations on integer flow polytopes that avoids pathologies while preserving combinatorial properties

If this is right

  • Framing triangulations apply to every integer flow polytope, not merely unit ones.
  • All previously described framing triangulation settings from the literature become special cases.
  • Connections to Catalan and Cambrian combinatorics are expected to carry over to the general setting.
  • Volume and h*-polynomial formulas from the unit case are expected to extend.
  • Pathologies that arise without the well-ordered condition are excluded.

Where Pith is reading between the lines

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

  • The two recent partial extensions to non-unit polytopes mentioned in the paper can now be checked directly for membership in the well-ordered class.
  • Pathologies observed in unrestricted triangulations supply concrete test cases for determining exactly which combinatorial properties require the well-ordering condition.
  • The construction may supply a uniform method for producing triangulations on flow polytopes that arise from networks with arbitrary integer capacities.

Load-bearing premise

Well-ordered framing triangulations can be defined in a way that inherits key properties from the unit case while containing all existing settings of framing triangulations in the literature.

What would settle it

A specific well-ordered framing triangulation on a non-unit integer flow polytope that either violates a volume or h*-polynomial formula inherited from the unit case or fails to include one of the two non-unit settings already described in the literature.

Figures

Figures reproduced from arXiv: 2605.24328 by Jonah Berggren.

Figure 1
Figure 1. Figure 1: A DAG G with netflow vector a labelled in blue (top-left), a framed augmentation (G, ˆ aˆ, Fˆ) (bottom-left), and its framing-triangulated flow polytope (right). (2) for any i ∈ [m], we have L i = min< + src n L ∈ Layerings(G, ˆ aˆ, Fˆ) : routes({L}) ⊆ routes({L i , . . . , Lm}) o , and (3) for any i ∈ [m], there exists a route of L i which is not in routes({L i+1, . . . , Lm}). In fact, the layering-simpl… view at source ↗
Figure 2
Figure 2. Figure 2: A DKK-framed DAG, its two maximal cliques, and its framing￾triangulated flow polytope. There have been two recent works extending DKK-framing triangulation results to flow polytopes from DAGs outside of the unit one-source-one-sink case. In a major concurrent paper, Gonz´alez D’Le´on, Hanusa, and Yip [DHY25] (among other things) give a generaliza￾tion of DKK-framing triangulations to the setting of flow po… view at source ↗
Figure 3
Figure 3. Figure 3: A conservationist (G, a, F) (left) and its two-point identification (right). If p and q are routes of G which both contain the internal vertex i, then we say that p <+ i q if p + i < + i q + i , where p + i (resp. q + i ) is the subpath of p (resp. q) from i to a sink. If p and q agree after the vertex i, then p = + i q (even if p and q differ before the vertex i). We may similarly write p <− i q or p = − … view at source ↗
Figure 4
Figure 4. Figure 4: A framed DAG with netflow vector a = (1, 1, 0, −2) and its framing-triangulated flow polytope. and L 2 := {α1β2, β1β2}; note that L 1 <+ src L 2 . The set routes({L 1 , L2}) is a route-clique. On the other hand, the <+ src-minimal layering using routes of routes({L 1 , L2}) is {α1α2, β1β2} ̸∈ {L 1 , L2}, so {L 1 , L2} fails to be a layering-simplex by Definition 3.13 (2). Definition 3.13 (3) does not disqu… view at source ↗
Figure 5
Figure 5. Figure 5: The complete bipartite graph K3,3. The final sentence of Theorem 2.1 shows that for any layering L, the vertices of ∆1(L) form a Z-basis of their linear span, hence that ∆1(L) is unimodular. □ We finally make the following remark, which follows from Corollary 3.19 because all max￾imal cells of a triangulation of a polytope P are of dimension dim(P). Corollary 3.20. The cardinality of every maximal layering… view at source ↗
Figure 4
Figure 4. Figure 4: Note that the layering-simplices of Example 3.15 may be defined from a pairwise [PITH_FULL_IMAGE:figures/full_fig_p017_4.png] view at source ↗
Figure 6
Figure 6. Figure 6: The order <+ src of all six layerings of (K3,3, a, F). For i ∈ [6], let L(i) be the set of layerings ∪j∈[6] : j̸=iL(1). The flow polytope FK3,3 (a) is four-dimensional, so all layering-simplices of (K3,3, a, F) will have cardinality five by Corol￾lary 3.20. This means that all layering-simplices are of the form L(i) for some i ∈ [6]; we will now calculate which of these six sets form layering-simplices usi… view at source ↗
Figure 7
Figure 7. Figure 7: On the left is a DAG G with netflow vector a, and on the right are the two possible augmentations of (G, a) with new vertices and edges in green. (4) the netflow vector aˆ sends all vertices of V to 0, all vertices of VX to 1, and all vertices of VY to negative integers subject to the condition ai = X y∈EY : t(y)=i aˆh(y) for all i ∈ V with ai < 0. When we have chosen (G, a) as well as an augmentation (G, … view at source ↗
Figure 8
Figure 8. Figure 8: The framing triangulation of an augmentation from [PITH_FULL_IMAGE:figures/full_fig_p022_8.png] view at source ↗
Figure 9
Figure 9. Figure 9: A tuple (G, a), a well-ordered framed augmentation (G, ˆ aˆ, Fˆ), and its framing-triangulated flow polytope. v1 v2 v3 v4 v5 v1 v2 v3 v4 v5 s1 s2 t2 t1 −1 −1 1 1 0 [PITH_FULL_IMAGE:figures/full_fig_p026_9.png] view at source ↗
Figure 10
Figure 10. Figure 10: A strongly planar embedding (Γ, a) (left) with a strongly planar balanced augmentation (right). equivalent to a 2 × 1 rectangle, shown on the right with the vertices indexed by the cor￾responding layering. Vertices whose layerings are compatible are connected by a solid or dotted line, drawing the framing triangulation. For example, the layerings L := {x1α2β2y1, x2β1y1} and M := {x1α1β1y1, x2α2y1} fail to… view at source ↗
Figure 11
Figure 11. Figure 11: The flow polytope FG(a) of the DAG of [PITH_FULL_IMAGE:figures/full_fig_p027_11.png] view at source ↗
read the original abstract

Framing triangulations of unit flow polytopes have received a great deal of recent study with rich connections to various generalizations of Catalan and Cambrian combinatorics as well as volume and h*-polynomial formulas. This story has largely been restricted to unit flow polytopes, with only two recent works giving descriptions of framing triangulations on classes of non-unit flow polytopes. In this article we introduce the first theory of (unimodular) framing triangulations for arbitrary integer flow polytopes. We will observe some pathologies in general examples which are impossible in the unit case, and propose in response a class of "well-ordered" framing triangulations which we expect to inherit key properties from the unit case while still containing all settings of framing triangulations existing in the literature.

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

1 major / 1 minor

Summary. The manuscript introduces the first theory of unimodular framing triangulations for arbitrary integer flow polytopes. It observes pathologies absent from the unit case and proposes a subclass of 'well-ordered' framing triangulations expected to inherit key properties from the unit case while containing all existing literature settings of framing triangulations.

Significance. If the well-ordered subclass can be shown to inherit the relevant combinatorial properties (e.g., connections to generalized Catalan/Cambrian structures and explicit volume/h*-polynomial formulas) and to subsume the two cited non-unit constructions, the work would provide a uniform framework extending recent results beyond unit flow polytopes. The proposal itself is a natural response to the observed pathologies, but its significance hinges on explicit verification of inheritance and containment rather than expectation alone.

major comments (1)
  1. [Abstract, final paragraph] Abstract (final paragraph): the central claim that well-ordered framing triangulations 'inherit key properties from the unit case while still containing all settings of framing triangulations existing in the literature' is presented as an expectation without an explicit definition, inclusion proof, or check against the two cited non-unit works. This assumption is load-bearing for the assertion that the new theory extends the unit-case results to arbitrary integer flow polytopes.
minor comments (1)
  1. [Abstract] The abstract states that pathologies will be observed in general examples but provides no concrete example or reference to a specific section or figure illustrating them; adding one brief, self-contained example would clarify the motivation for the well-ordered restriction.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their careful reading and for identifying the load-bearing nature of the claims regarding well-ordered framing triangulations. We address the single major comment below and will revise the manuscript accordingly.

read point-by-point responses

  1. Referee: [Abstract, final paragraph] Abstract (final paragraph): the central claim that well-ordered framing triangulations 'inherit key properties from the unit case while still containing all settings of framing triangulations existing in the literature' is presented as an expectation without an explicit definition, inclusion proof, or check against the two cited non-unit works. This assumption is load-bearing for the assertion that the new theory extends the unit-case results to arbitrary integer flow polytopes.

    Authors: We agree that the abstract presents the inheritance of properties and the containment of literature examples as an expectation without supplying the supporting details. The manuscript defines well-ordered framing triangulations explicitly in Definition 3.5. Section 4 verifies containment by showing that both cited non-unit constructions satisfy the well-ordered condition. The inheritance of combinatorial properties (e.g., generalized Catalan/Cambrian connections and explicit volume/h*-formulas) remains conjectural, supported by the elimination of unit-case pathologies and explicit computations in low-dimensional cases, but without a general proof. We will revise the abstract to state clearly that the well-ordered class is defined to contain the known examples (with the proof referenced to the body) and that inheritance is conjectured; we will also add an explicit conjecture statement in the introduction and a short subsection summarizing the checks against the two non-unit works. This addresses the concern directly. revision: yes

Circularity Check

0 steps flagged

No circularity: new definition proposed without reduction to inputs

full rationale

The paper proposes a new definitional class of well-ordered framing triangulations for arbitrary integer flow polytopes, stating an expectation that this class will inherit unit-case properties and subsume prior literature examples. No equations, parameter fits, uniqueness theorems, or self-citations are invoked in a load-bearing way that would make any claimed result equivalent to its inputs by construction. The work is self-contained as an extension via definition rather than a derivation chain that loops back.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Only the abstract is available; no specific free parameters, axioms, or invented entities can be extracted from the provided text.

pith-pipeline@v0.9.1-grok · 5646 in / 977 out tokens · 39716 ms · 2026-06-30T13:43:29.042475+00:00 · methodology

discussion (0)

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

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Locally anti-blocking $\mathbf{g}$-polytopes for flow polytopes

    math.CO 2026-05 unverdicted novelty 5.0

    Combinatorial characterization of locally anti-blocking g-polytopes arising from amply framed DAG flow polytopes, including minimal faces, pulling triangulations, and coherence diagrams.

Reference graph

Works this paper leans on

5 extracted references · 5 canonical work pages · cited by 1 Pith paper

  1. [1]

    Morales, GaYee Park, and Hugh Thomas

    [ABD+26] Antoine Abram, Jose Bastidas, Benjamin Dequˆ ene, Alejandro H. Morales, GaYee Park, and Hugh Thomas. Flows on graphs with cycles, locally gentle algebras, and the mutoperhedron. 2026.arXiv:2601.08150. [BBB+24] Matias von Bell, Benjamin Braun, Kaitlin Bruegge, Derek Hanely, Zachery Peterson, Khrystyna Serhiyenko, and Martha Yip. Triangulations of ...

    work page arXiv 2026

  2. [2]

    [Ber25] Jonah Berggren

    doi:10.4153/s0008414x19000397. [Ber25] Jonah Berggren. Flows on gentle algebras. 2025.arXiv:2507.12688. [Ber26] Jonah Berggren. Framing triangulations and framing posets of planar dags with nontrivial netflow vectors. 2026.arXiv:2507.12684. [BGDMCY23] Matias von Bell, Rafael S. Gonz´ alez D’Le´ on, Francisco A. Mayorga Cetina, and Martha Yip. A unifying f...

    work page doi:10.4153/s0008414x19000397 2025

  3. [3]

    [DHY25] Rafael S

    URL:http://projecteuclid.org/euclid.em/ 1046889594. [DHY25] Rafael S. Gonz´ alez D’Le´ on, Christopher R. H. Hanusa, and Martha Yip. Permutation flows I: Triangulations of flow polytopes (research announcement). 2025.arXiv:2512.04078. [DKK12] Vladimir I. Danilov, Alexander V. Karzanov, and Gleb A. Koshevoy. Coherent fans in the space of flows in framed gr...

    work page arXiv 2025

  4. [4]

    Toric matrix Schubert varieties and their polytopes

    [EM16] Laura Escobar and Karola M´ esz´ aros. Toric matrix Schubert varieties and their polytopes. Proc. Amer. Math. Soc., 144(12):5081–5096, 2016.doi:10.1090/proc/13152. [FRAdW71] Michael Florian, Maurice Rossin-Arthiat, and Dominique de Werra. A property of minimum concave cost flows in capacitated networks.INFOR—Canad. J. Operational Res. and Infor- ma...

    work page doi:10.1090/proc/13152 2016

  5. [5]

    [LMSD19] Ricky I

    Special issue on linear algebra methods in representation theory.doi:10.1016/S0024-3795(02)00406-8. [LMSD19] Ricky I. Liu, Karola M´ esz´ aros, and Avery St. Dizier. Gelfand-Tsetlin polytopes: a story of flow and order polytopes.SIAM J. Discrete Math., 33(4):2394–2415, 2019.doi:10.1137/ 19M1251242. 30 [MM15] Karola M´ esz´ aros and Alejandro H. Morales. F...

    work page doi:10.1016/s0024-3795(02)00406-8 2019