Related papers: Flow polytopes of partitions
Recently, Benedetti et al. introduced an Ehrhart-like polynomial associated to a graph. This polynomial is defined as the volume of a certain flow polytope related to a graph and has the property that the leading coefficient is the volume…
We classify all tuples of lattice polyhedra of relative mixed volume 1 and all minimal (by inclusion) tuples of polyhedra of relative mixed volume 2. We also prove a conjecture by A. Esterov, which states that all tuples with finite…
For a family of polytopes of even dimension $2p$, known as \textit{dual-neighborly}, it has been shown for $p\ne 2$ that the associated intersection of quadrics is a connected sum of sphere products $S^p\times S^p$. In this article we give…
2-level polytopes naturally appear in several areas of pure and applied mathematics, including combinatorial optimization, polyhedral combinatorics, communication complexity, and statistics. In this paper, we present a study of some 2-level…
In this paper we investigate the flow of surfaces by a class of symmetric functions of the principal curvatures with a mixed volume constraint. We consider compact surfaces without boundary that can be written as a graph over a sphere. The…
Regular triangulations of products of lattice polytopes are constructed with the additional property that the dual graphs of the triangulations are bipartite. The (weighted) size difference of this bipartition is a lower bound for the…
A common generalization for the chromatic polynomial and the flow polynomial of a graph $G$ is the Tutte polynomial $T(G;x,y)$. The combinatorial meaning for the coefficients of $T$ was discovered by Tutte at the beginning of its…
Let $x\in\mathbb{R}^{n}$. For $\phi:\mathbb{R}^{n}\mapsto\mathbb{R}^{n}$ and $t\in\mathbb{R}$, we put $\phi^{t}=t^{-1}\phi(xt)$. A projective flow is a solution to the projective translation equation $\phi^{t+s}=\phi^{t}\circ\phi^{s}$,…
The aim of this paper is to study alcoved polytopes, which are polytopes arising from affine Coxeter arrangements. This class of convex polytopes includes many classical polytopes, for example, the hypersimplices. We compare two…
The Kostka-Foulkes polynomials $K$ related to a root system $\phi $ can be defined as alternated sums running over the Weyl group associated to $\phi .$ By restricting these sums over the elements of the symmetric group when $% \phi $ is of…
This paper defines, for each convex polytope $\Delta$, a family $H_w\Delta$ of vector spaces. The definition uses a combination of linear algebra and combinatorics. When what is called exact calculation holds, the dimension $h_w\Delta$ of…
The celebrated Antezana-Pujals-Stojanoff Theorem states that the iterated Aluthge transforms of an arbitrary matrix converge to a normal matrix. We introduce a family of matrix flows that share this convergence property by defining them…
The degree partition of a simple graph is its degree sequence rearranged in weakly decreasing order. The polytope of degree partitions (respectively, degree sequences) is the convex hull of all degree partitions (respectively, degree…
We show that for fixed $d>3$ and $n$ growing to infinity there are at least $(n!)^{d-2 \pm o(1)}$ different labeled combinatorial types of $d$-polytopes with $n$ vertices. This is about the square of the previous best lower bounds. As an…
We investigate a family of polytopes introduced by E.M.\ Feichtner, A.\ Postnikov and B.\ Sturmfels, which were named nestohedra. The vertices of these polytopes may intuitively be understood as constructions of hypergraphs. Limit cases in…
The Baldoni--Vergne volume and Ehrhart polynomial formulas for flow polytopes are significant in at least two ways. On one hand, these formulas are in terms of Kostant partition functions, connecting flow polytopes to this classical vector…
As an absolute invariant of smooth conjugacy, the multiplier group described the types of space-time symmetries that the flow has, and for a quasiperiodic flow on the $n$-torus, is the determining factor of the structure of its generalized…
A computational flow is a pair consisting of a sequence of computational problems of a certain sort and a sequence of computational reductions among them. In this paper we will develop a theory for these computational flows and we will use…
Although simplices are trivial from a linear optimization standpoint, the simplex algorithm can exhibit quite complex behavior. In this paper we study the behavior of max-slope pivot rules on (products of) simplices and describe the…
We present the first polytope volume formulas for the multiplicities of affine fusion, the fusion in Wess-Zumino-Witten conformal field theories, for example. Thus, we characterise fusion multiplicities as discretised volumes of certain…