A Triangulation of the Flow Polytope of the Zigzag Graph

We show that the dual graph of the triangulation of the flow polytope of the zigzag graph adorned with the length-reverse-length framing is a subgraph of a grid graph. Through Mészáros, Morales, and Striker's bijection between simplices of the triangulation, integer flows of a different, supplemental flow polytope, we provide a simple numerical characterization of the adjacency between the triangulation's simplices in terms of their corresponding integer flows. The proofs result from the development of Postnikov and Stanley's sequences of noncrossing bipartite trees as combinatorial objects we call groves. We propose two new statistics derived from this construction that we conjecture recover the $h^*$-polynomial of the flow polytope of the zigzag graph.

Authors

Publication Details

Journal
The Electronic Journal of Combinatorics
Published
2026-10-09
DOI
https://doi.org/10.37236/13162
Citations
1
Primary Topic
Advanced Combinatorial Mathematics
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Triangulation of the Flow Polytope of the Zigzag Graph

Christopher R. H. Hanusa, Rachel Brunner
1 citations
The Electronic Journal of Combinatorics
Advanced Combinatorial Mathematics
article

A Triangulation of the Flow Polytope of the Zigzag Graph

Christopher R. H. Hanusa, Rachel Brunner
article en
1 citations

Abstract

We show that the dual graph of the triangulation of the flow polytope of the zigzag graph adorned with the length-reverse-length framing is a subgraph of a grid graph. Through Mészáros, Morales, and Striker's bijection between simplices of the triangulation, integer flows of a different, supplemental flow polytope, we provide a simple numerical characterization of the adjacency between the triangulation's simplices in terms of their corresponding integer flows. The proofs result from the development of Postnikov and Stanley's sequences of noncrossing bipartite trees as combinatorial objects we call groves. We propose two new statistics derived from this construction that we conjecture recover the $h^*$-polynomial of the flow polytope of the zigzag graph.

The Electronic Journal of CombinatoricsVol. 33(4)
National Science Foundation, City University of New York
Openalex Percentile: Top 94%
Advanced Combinatorial Mathematics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.