Related papers: Flow polytopes of signed graphs and the Kostant pa…
We provide a new algebraic technique to solve the sequential flow problem in polynomial space. The task is to maximise the flow through a graph where edge capacities can be changed over time by choosing a sequence of capacity labelings from…
The goal of this article is to obtain bounds on the coefficients of modular and integral flow and tension polynomials of graphs. To this end we make use of the fact that these polynomials can be realized as Ehrhart polynomials of inside-out…
The paper is concerned with the linkedness of the graphs of cubical polytopes. A graph with at least $2k$ vertices is \textit{$k$-linked} if, for every set of $k$ disjoint pairs of vertices, there are $k$ vertex-disjoint paths joining the…
We propose a version of the volume conjecture that would relate a certain limit of the colored Jones polynomials of a knot to the volume function defined by a representation of the fundamental group of the knot complement to the special…
In furtherance of our earlier work (Chen \& Sreenivasan, {\it J. Fluid Mech.} {\bf 908}, 2021, p. R3; {\bf 933}, 2022, p. A20 -- together referred to as CS hereafter), we present a self-consistent Reynolds number asymptotics for wall-normal…
We first prove some general results on pathwise uniqueness, comparison property and existence of nonnegative strong solutions of stochastic equations driven by white noises and Poisson random measures. The results are then used to prove the…
We prove a conjecture of Meszaros and Morales on the volume of a flow polytope. Independently from our work, Zeilberger sketched a proof of their conjecture. In fact, our proof is the same as Zeilberger's proof. The purpose of this note is…
In 1999, Pitman and Stanley introduced the polytope bearing their name along with a study of its faces, lattice points, and volume. The Pitman-Stanley polytope is well-studied due to its connections to probability, parking functions, the…
An elliptic Newton flow is a dynamical system that can be interpreted as a continuous version of Newton's iteration method for finding the zeros of an elliptic function f. Previous work focusses on structurally stable flows (i.e., the phase…
We consider consistent dynamics for non-intersecting birth and death chains, originating from dualities of stochastic coalescing flows and one dimensional orthogonal polynomials. As corollaries, we obtain unified and simple probabilistic…
Lattices of polynomial KP and BKP $\tau$-functions labelled by partitions, with the flow variables equated to finite power sums, as well as associated multipair KP and multipoint BKP correlation functions are expressed via generalizations…
We experimentally study the properties of mean and most probable velocity fields in a turbulent von K\'arm\'an flow. These fields are found to be described by two families of functions, as predicted by a recent statistical mechanics study…
The volume of a Cartier divisor is an asymptotic invariant, which measures the rate of growth of sections of powers of the divisor. It extends to a continuous, homogeneous, and log-concave function on the whole N\'eron--Severi space, thus…
The polytope of integer partitions of $n$ is the convex hull of the corresponding $n$-dimensional integer points. Its vertices are of importance because every partition is their convex combination. Computation shows intriguing features of…
We set out some general criteria to prove the K-property, refining the assumptions used in arXiv:1906.09315 for the flow case, and introducing the analogous discrete-time result. We also introduce one-sided $\lambda$-decompositions, as well…
For a topological flow $(V,\phi)$ - i.e., $V$ is a linearly compact vector space and $\phi$ a continuous endomorphism of $V$ - we gain a deep understanding of the relationship between $(V,\phi)$ and the Bernoulli shift: a topological flow…
This is the second of two papers where we study polytopes arising from affine Coxeter arrangements. Our results include a formula for their volumes, and also compatible definitions of hypersimplices, descent numbers and major index for all…
We establish a quadratic identity for the Yamada polynomial of ribbon cubic graphs in 3-space, extending the Tutte golden identity for planar cubic graphs. An application is given to the structure of the flow polynomial of cubic graphs at…
The cut polytope ${\rm CUT}(n)$ is the convex hull of the cut vectors in a complete graph with vertex set $\{1,\ldots,n\}$. It is well known in the area of combinatorial optimization and recently has also been studied in a direct relation…
Polytopes from subgraph statistics are important in applications and conjectures and theorems in extremal graph theory can be stated as properties of them. We have studied them with a view towards applications by inscribing large explicit…