Search arXivSearch

arXiv · 2408.05320

Equatorial Flow Triangulations of Gorenstein Flow Polytopes

Abstract

Generalizing work of Athanasiadis for the Birkhoff polytope and Reiner and Welker for order polytopes, in 2007 Bruns and Römer proved that any Gorenstein lattice polytope with a regular unimodular triangulation admits a regular unimodular triangulation that is the join of a special simplex with a triangulated sphere. These are sometimes referred to as equatorial triangulations. We apply these techniques to give purely combinatorial descriptions of previously-unstudied triangulations of Gorensten flow polytopes. Further, we prove that the resulting equatorial flow polytope triangulations are usually distinct from the family of triangulations obtained by Danilov, Karzanov, and Koshevoy via framings. We find the facet description of the reflexive polytope obtained by projecting a Gorenstein flow polytope along a special simplex. Finally, we show that when a partially ordered set is strongly planar, equatorial triangulations of a related flow polytope can be used to produce new unimodular triangulations of the corresponding order polytope.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Benjamin Braun, Alvaro Cornejo. 2025-02-14. Equatorial Flow Triangulations of Gorenstein Flow Polytopes. https://arxiv.org/abs/2408.05320

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO