Related papers: Triangulations of Flow Polytopes, Ample Framings, …
The space of unit flows on a directed acyclic graph (DAG) with one source and one sink is known to admit regular unimodular triangulations induced by framings of the DAG. The dual graph of any of these triangulations may be given the…
Given an acyclic directed graph (DAG), the space of strength one flows is a lattice polytope called the flow polytope of the DAG. If the DAG admits an ample framing, then the flow polytope is Gorenstein and it linearly projects onto a…
In the study of flow polytopes, a directed acyclic graph (DAG) with a choice of framing gives a regular unimodular triangulation on its space of unit nonnegative flows. In representation theory, a gentle algebra has recently been equipped…
The space of unit flows on a directed acyclic graph (DAG) is known to admit regular unimodular triangulations induced by framings of the DAG. Amply framed DAGs and their triangulated flow polytopes have recently been connected with the…
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…
Flow cones of a directed acyclic graph admit a family of unimodular triangulations given by Danilov, Karzanov, and Koshevoy (DKK) whose normal fans are related to (generalizations) of the associahedron and permutahedron. A correspondence…
Generalizing work of Athanasiadis for the Birkhoff polytope and Reiner and Welker for order polytopes, in 2007 Bruns and R\"omer proved that any Gorenstein lattice polytope with a regular unimodular triangulation admits a regular unimodular…
We show that every directed graph $G$ with $n$ vertices and $m$ edges admits a directed acyclic graph (DAG) with $m^{1+o(1)}$ edges, called a DAG projection, that can either $(1+1/\text{polylog} (n))$-approximate distances between all pairs…
Given a finite directed acyclic graph, the space of non-negative unit flows is a lattice polytope called the flow polytope of the graph. We consider the volumes of flow polytopes for directed acyclic graphs on $n+1$ vertices with a fixed…
The space of unit flows on a finite acyclic directed graph is a lattice polytope called the flow polytope of the graph. Given a bipartite graph $G$ with minimum degree at least two, we construct two associated acyclic directed graphs: the…
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\'esz\'aros, Morales, and Striker's bijection between simplices…
Cosmological polytopes of graphs are a geometric tool in physics to study wavefunctions for cosmological models whose Feynman diagram is given by the graph. After their recent introduction by Arkani-Hamed, Benincasa and Postnikov the focus…
Not every directed acyclic graph (DAG) whose underlying undirected graph is planar admits an upward planar drawing. We are interested in pushing the notion of upward drawings beyond planarity by considering upward $k$-planar drawings of…
Directed acyclic graphs (DAGs) can be characterised as directed graphs whose strongly connected components are isolated vertices. Using this restriction on the strong components, we discover that when $m = cn$, where $m$ is the number of…
The flow polytope $\mathcal{F}_{\widetilde{G}}$ is the set of nonnegative unit flows on the graph $\widetilde{G}$. The subdivision algebra of flow polytopes prescribes a way to dissect a flow polytope $\mathcal{F}_{\widetilde{G}}$ into…
Equiangular tight frames provide optimal packings of lines through the origin. We combine Steiner triple systems with Hadamard matrices to produce a new infinite family of equiangular tight frames. This in turn leads to new constructions of…
We study the strongly connected components of the flow graph associated to a veering triangulation, and show that the infinitesimal components must be of a certain form, which have to do with subsets of the triangulation which we call…
Learning the structure of Directed Acyclic Graphs (DAGs) presents a significant challenge due to the vast combinatorial search space of possible graphs, which scales exponentially with the number of nodes. Recent advancements have redefined…
We introduce a new broadly unifying family of combinatorial objects, which we call permutation flows, associated to an acyclic directed graph $G$ together with a framing $F$. This new family is combinatorially rich and contains as special…
For any finite set $\A$ of $n$ points in $\R^2$, we define a $(3n-3)$-dimensional simple polyhedron whose face poset is isomorphic to the poset of ``non-crossing marked graphs'' with vertex set $\A$, where a marked graph is defined as a…