Related papers: Permutation Flows I: Triangulations of Flow Polyto…
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…
We introduce new families of combinatorial objects whose enumeration computes volumes of flow polytopes. These objects provide an interpretation, based on parking functions, of Baldoni and Vergne's generalization of a volume formula…
Recent progress on flow polytopes indicates many interesting families with product formulas for their volume. These product formulas are all proved using analytic techniques. Our work breaks from this pattern. We define a family of closely…
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…
In this paper, we describe a new approach to the problem of classification of transitive Anosov flows on 3-manifolds up to orbital equivalence. More specifically, generalizing the notion of Markov partition, we introduce the notion of…
Flow polytopes of acyclic oriented graphs arise naturally in combinatorial optimization, and the study of their volumes and triangulations has revealed intriguing connections across combinatorics, geometry, algebra, and representation…
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…
We study polytopes defined by inequalities of the form $\sum_{i\in I} z_{i}\leq 1$ for $I\subseteq [d]$ and nonnegative $z_i$ where the inequalities can be reordered into a matrix inequality involving a column-convex $\{0,1\}$-matrix. These…
Recently, a combinatorial interpretation of Baldoni and Vergne's generalized Lidskii formula for the volume of a flow polytope was developed by Benedetti et al.. This converts the problem of computing Kostant partition functions into a…
This paper deals with lattice congruences of the weak order on the symmetric group, and initiates the investigation of the cover graphs of the corresponding lattice quotients. These graphs also arise as the skeleta of the so-called…
In this paper we study an alternating sign matrix analogue of the Chan-Robbins-Yuen polytope, which we call the ASM-CRY polytope. We show that this polytope has Catalan many vertices and its volume is equal to the number of standard Young…
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…
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…
In this paper, we introduce two discrete curvature flows, which are called $\alpha$-flows on two and three dimensional triangulated manifolds. For triangulated surface $M$, we introduce a new normalization of combinatorial Ricci flow (first…
We consider the general problem of mixing of Gaussian solute plumes arising across a range of different flows ranging from two-dimensional (2D) to three-dimensional (3D), steady to unsteady, regular to chaotic, Stokes to turbulent. We…
We present a unifying framework in which both the $\nu$-Tamari lattice, introduced by Pr\'eville-Ratelle and Viennot, and principal order ideals in Young's lattice indexed by lattice paths $\nu$, are realized as the dual graphs of two…
Learning permutations is fundamental to sorting, ranking, and matching, but existing differentiable methods based on entropy-regularized Sinkhorn produce a single softened solution and collapse under ambiguity. We present PermFlow, a…
This paper came to existence out of the desire to understand iterations of strictly triangular polynomial maps over finite fields. This resulted in two connected results: First, we give a generalization of $\F_p$-actions on $\F_p^n$ and…
This work presents mixed variational flows (MixFlows), a new variational family that consists of a mixture of repeated applications of a map to an initial reference distribution. First, we provide efficient algorithms for i.i.d. sampling,…
The study of pinnacle sets has been a recent area of interest in combinatorics. Given a permutation, its pinnacle set is the set of all values larger than the values on either side of it. Largely inspired by conjectures posed by Davis,…