Daeseok Lee, Hyeong-Kwan Ju
The aim of this work is to introduce several different volume computation methods of the graph polytope associated with various type of finite simple graphs. Among them, we obtained the recursive volume formula (RVF) that is fundamental and most useful to compute the volume of the graph polytope for an arbitrary finite simple graph.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
We present a new algorithm for computing the volume of an arbitrary matroid base polytope. We provide two applications of this approach: a relation between the volume of the base polytope of a matroid $\M$ and its relaxation $\M'$, and a formula for the volume of an arbitrary sparse paving matroid base polytope.
We survey the computation of polytope volumes by the algorithms of Normaliz to which the Lawrence algorithm has recently been added. It has enabled us to master volume computations for polytopes from social choice in dimension $119$. This challenge required a sophisticated implementation of the Lawrence algorithm.
We classify all the possible $delta$-vectors of d-dimensional integral convex polytopes whose volumes are less than or equal to 3/(d!).
A complete classification of the $δ$-vectors of lattice polytopes whose normalized volumes are at most $4$ is known. In the present paper, we will classify all the $δ$-vectors of lattice polytopes with normalized volumes $5$.
Intrigued by the product formula prod_{i=1}^{n-2} C_i for the volume of the Chan-Robbins-Yuen polytope CRY_n, where C_i is the ith Catalan number, we construct a family of polytopes P_{m,n}, whose volumes are given by the product \prod_{i=m+1}^{m+n-2}\frac{1}{2i+1}{{m+n+i} \choose {2i}}. The Chan-Robbins-Yuen polytope CRY_n coincides with P_{0,n-1}. Our construction of the polytopes P_{m,n} is an application of a systematic method we develop for expressing volumes of a class of flow polytopes as the number of certain triangular arrays. This method can also be used as a heuristic technique for …
In these notes, we explain residue formulae for volumes of convex polytopes, and for Ehrahrt polynomials based on the notion of total residue. We apply this method to the computation of the volume of the Chan-Robbins polytope. The final computation is based on a total residue formula for the system $A_n$, similar to Morris identity. For flow polytopes, a formula of change of variables in total residues leads to a "nice formula" for Ehrhart polynomials in function of mixed volumes. We apply it to Pitman-Stanley polytope.
The Chan-Robbins-Yuen polytope can be thought of as the flow polytope of the complete graph with netflow vector $(1, 0, \ldots, 0, -1)$. The normalized volume of the Chan-Robbins-Yuen polytope equals the product of consecutive Catalan numbers, yet there is no combinatorial proof of this fact. We consider a natural generalization of this polytope, namely, the flow polytope of the complete graph with netflow vector $(1,1, 0, \ldots, 0, -2)$. We show that the volume of this polytope is a certain power of $2$ times the product of consecutive Catalan numbers. Our proof uses constant term identities…
The free sum is a basic geometric operation among convex polytopes. This note focuses on the relationship between the normalized volume of the free sum and that of the summands. In particular, we show that the normalized volume of the free sum of full dimensional polytopes is precisely the product of the normalized volumes of the summands.
This paper focuses on determining the volumes of permutation polytopes associated to cyclic groups, dihedral groups, groups of automorphisms of tree graphs, and Frobenius groups. We do this through the use of triangulations and the calculation of Ehrhart polynomials. We also present results on the theta body hierarchy of various permutation polytopes.
In the frame of a classification of general square systems of polynomial equations solvable by radicals, Esterov and Gusev succeeded in classifying all spanning lattice polytopes whose normalized volumes are at most $4$. In the present paper, we complete to classify all lattice polytopes whose normalized volumes are at most $4$ based on the known classification of their $δ$-polynomials.
Let $(P,\leq_P)$ and $(Q,\leq_Q)$ be finite partially ordered sets with $|P|=|Q|=d$, and $\mathcal{C}(P) \subset \mathbb{R}^d$ and $\mathcal{C}(Q) \subset \mathbb{R}^d$ their chain polytopes. The twinned chain polytope of $P$ and $Q$ is the lattice polytope $Γ(\mathcal{C}(P),\mathcal{C}(Q)) \subset \mathbb{R}^d$ which is the convex hull of $\mathcal{C}(P) \cup (-\mathcal{C}(Q))$. It is known that twinned chain polytopes are Gorenstein Fano polytopes with the integer decomposition property. In the present paper, we study combinatorial properties of twinned chain polytopes. First, we will give t…
We consider a minimum enclosing and maximum inscribed tropical balls for any given tropical polytope over the tropical projective torus in terms of the tropical metric with the max-plus algebra. We show that we can obtain such tropical balls via linear programming. Then we apply minimum enclosing and maximum inscribed tropical balls of any given tropical polytope to estimate the volume of and sample uniformly from the tropical polytope.
In this paper, we consider the volume of a special kind of flow polytope. We show that its volume satisfies a certain system of differential equations, and conversely, the solution of the system of differential equations is unique up to a constant multiple. In addition, we give an inductive formula for the volume with respect to the rank of the root system of type A.
For a d-dimensional convex lattice polytope P, a formula for the boundary volume is derived in terms of the number of boundary lattice points on the first $\floor{d/2}$ dilations of P. As an application we give a necessary and sufficient condition for a polytope to be reflexive, and derive formulae for the f-vector of a smooth polytope in dimensions 3, 4, and 5. We also give applications to reflexive order polytopes, and to the Birkhoff polytope.
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 originally due to Lidskii. We recover known flow polytope volume formulas and prove new volume formulas for flow polytopes that were seemingly unapproachable. A highlight of our model is an elegant formula for the flow polytope of a graph we call the caracol graph. As by-products of our work, we uncover a new triangle of numbers that interpolates between Catalan nu…
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 to give a more detailed proof of the conjecture.
The normalized volume of the Chan-Robbins-Yuen polytope ($CRY_n$) is the product of consecutive Catalan numbers. The polytope $CRY_n$ has captivated combinatorial audiences for over a decade, as there is no combinatorial proof for its volume formula. In their quest to understand $CRY_n$ better, the third author and Morales introduced two natural generalizations of it and conjectured that their volumes are certain powers of $2$ multiplied by a product of consecutive Catalan numbers. Zeilberger proved one of these conjectures. In this paper we present proofs of both conjectures.
Flow polytopes are an important class of polytopes in combinatorics whose lattice points and volumes have interesting properties and relations. The Chan-Robbins-Yuen (CRY) polytope is a flow polytope with normalized volume equal to the product of consecutive Catalan numbers. Zeilberger proved this by evaluating the Morris constant term identity, but no combinatorial proof is known. There is a refinement of this formula that splits the largest Catalan number into Narayana numbers, which Mészáros gave an interpretation as the volume of a collection of flow polytopes. We introduce a new refinemen…
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 of the flow polytope of the original graph with net flow vector $(1,1,\dots,1)$. Benedetti et al. conjectured a formula for the Ehrhart-like polynomial of what they call a caracol graph. In this paper their conjecture is proved using constant term identities, labeled Dyck paths, and a cyclic lemma.
A polytope is integral if all of its vertices are lattice points. The constant term of the Ehrhart polynomial of an integral polytope is known to be 1. In previous work, we showed that the coefficients of the Ehrhart polynomial of a lattice-face polytope are volumes of projections of the polytope. We generalize both results by introducing a notion of $k$-integral polytopes, where 0-integral is equivalent to integral. We show that the Ehrhart polynomial of a $k$-integral polytope $P$ has the properties that the coefficients in degrees less than or equal to $k$ are determined by a projection of …
The Lidskii formula for the type $A_n$ root system expresses the volume and Ehrhart polynomial of the flow polytope of the complete graph with nonnegative integer netflows in terms of Kostant partition functions. For every integer polytope the volume is the leading coefficient of the Ehrhart polynomial. The beauty of the Lidskii formula is the revelation that for these polytopes its Ehrhart polynomial function can be deduced from its volume function! Baldoni and Vergne generalized Lidskii's result for flow polytopes of arbitrary graphs $G$ and nonnegative integer netflows. While their formulas…
Unitary actions and equivariant volumes of symmetric edge polytopes
该研究刻画了对称边多面体的刚性对称性，证明其酉等价等价于对应图同构，建立了对称群作用下不动子集的体积与小图对称边多面体的关系，并给出完全图情形的特例结果。
We present a multivariate generating function for all n x n nonnegative integral matrices with all row and column sums equal to a positive integer t, the so called semi-magic squares. As a consequence we obtain formulas for all coefficients of the Ehrhart polynomial of the polytope B_n of n x n doubly-stochastic matrices, also known as the Birkhoff polytope. In particular we derive formulas for the volumes of B_n and any of its faces.
Algebraic Volume for Polytope Arise from Ehrhart Theory
本文基于 Ehrhart 理论将多胞体提升为锥，利用代数组合学技术提出一种仅需符号单纯锥分解的体积算法，并给出全新的原始-对偶方法，解决了现有方法对简单或单纯多胞体不切实际的问题。
Let m,n be positive integers. Define T(m,n) to be the transportation polytope consisting of the m x n non-negative real matrices whose rows each sum to 1 and whose columns each sum to m/n. The special case B(n)=T(n,n) is the much-studied Birkhoff-von Neumann polytope of doubly-stochastic matrices. Using a recent asymptotic enumeration of non-negative integer matrices (Canfield and McKay, 2007), we determine the asymptotic volume of T(m,n) as n goes to infinity, with m=m(n) such that m/n neither decreases nor increases too quickly. In particular, we give an asymptotic formula for the volume of …
Let $\mathcal{P} \subset \mathbb{R}^d$ be a lattice polytope of dimension $d$. Let $b$ denote the number of lattice points belonging to the boundary of $\mathcal{P}$ and $c$ that to the interior of $\mathcal{P}$. It follows from a lower bound theorem of Ehrhart polynomials that, when $c > 0$, the volume of $\mathcal{P}$ is bigger than or equal to $(dc + (d-1)b - d^2 + 2)/d!$. In the present paper, via triangulations, a short and elementary proof of the minimal volume formula is given.
The n'th Birkhoff polytope $B_n$ is the set of all doubly stochastic $n \times n$ matrices, that is, those matrices with nonnegative real coefficients in which every row and column sums to one. A long-standing open problem is the determination of the relative volume of $B_n$. In [arXiv:math.CO/0202267] we introduced a method of calculating this volume and used it to compute $\vol B_9$. This note is an update on our progress: with the same program (but much longer computing time), we have now derived $\vol B_{10}$.
Normalized Volumes of Type-PQ Adjacency Polytopes for Certain Classes of Graphs
本文推广了Type-PQ邻接多胞体正规化体积的三角递推方法，并给出了从完全图删除路径或环后的体积公式。
We study the calculation of the volume of the polytope B_n of n by n doubly stochastic matrices; that is, the set of real non-negative matrices with all row and column sums equal to one. We describe two methods. The first involves a decomposition of the polytope into simplices. The second involves the enumeration of ``magic squares'', i.e., n by n non-negative integer matrices whose rows and columns all sum to the same integer. We have used the first method to confirm the previously known values through n=7. This method can also be used to compute the volumes of faces of B_n. For example, we h…
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 partition function fundamental in representation theory. On the other hand the Ehrhart polynomials can be read off from the volume functions of flow polytopes. The latter is remarkable since the leading term of the Ehrhart polynomial of an integer polytope is its volume! Baldoni and Vergne proved these formulas via residues. To reveal the geometry of these f…
Volume inequalities for flow polytopes of full directed acyclic graphs
本文研究固定度序列的有向无环图的流多胞体体积，证明存在与布尔代数同构的偏序，沿该偏序体积弱递减，并给出二分非交叉树的线性扩展解释。
The degree of a lattice polytope is a notion in Ehrhart theory that was studied quite intensively over the previous years. It is well-known that a lattice polytope has normalized volume one if and only if its degree is zero. Recently, Esterov and Gusev gave a complete classification result of families of $n$ lattice polytopes in $\mathbb{R}^n$ whose mixed volume equals one. Here, we give a reformulation of their result involving the novel notion of a mixed degree that generalizes the degree similar to how the mixed volume generalizes the volume. We discuss and motivate this terminology, and ex…
The n'th Birkhoff polytope is the set of all doubly stochastic n-by-n matrices, that is, those matrices with nonnegative real coefficients in which every row and column sums to one. A wide open problem concerns the volumes of these polytopes, which have been known for n up to 8. We present a new, complex-analytic way to compute the Ehrhart polynomial of the Birkhoff polytope, that is, the function counting the integer points in the dilated polytope. One reason to be interested in this counting function is that the leading term of the Ehrhart polynomial is--up to a trivial factor--the volume of…
A theorem of Scott gives an upper bound for the normalized volume of lattice polygons with exactly $i>0$ interior lattice points. We will show that the same bound is true for the normalized volume of lattice polytopes of degree 2 even in higher dimensions. In particular, there is only a finite number of quadratic polynomials with fixed leading coefficient being the $h^*$-polynomial of a lattice polytope.
A well known result by Lagarias and Ziegler states that there are finitely many equivalence classes of d-dimensional lattice polytopes having volume at most K, for fixed constants d and K. We describe an algorithm for the complete enumeration of such equivalence classes for arbitrary constants d and K. The algorithm, which gives another proof of the finiteness result, is implemented for small values of K, up to dimension six. The resulting database contains and extends several existing ones, and has been used to correct mistakes in other classifications. When specialized to three-dimensional s…
In this paper we investigate the problem of finding the maximum volume polytopes, inscribed in the unit sphere of the $d$-dimensional Euclidean space, with a given number of vertices. We solve this problem for polytopes with $d+2$ vertices in every dimension, and for polytopes with $d+3$ vertices in odd dimensions. For polytopes with $d+3$ vertices in even dimensions we give a partial solution.
Let n >= 2 be an integer and consider the set T_n of n by n permutation matrices pi for which pi_{ij}=0 for j>=i+2. In this paper we study the convex hull of T_n, which we denote by P_n. P_n is a polytope of dimension binom{n}{2}. Our main purpose is to provide evidence for the following conjecture concerning its volume. Let v_n denote the minimum volume of a simplex with vertices in the affine lattice spanned by T_n. Then the volume of P_n is v_n times the product for i varying from 0 to n-2 of frac{1}{i+1} binom{2i}{i}. That is, P_n is the product of v_n and the first n-1 Catalan numbers. We…
This note provides a simple proof for the equality between the normalized volume of a convex polytope with $m$ vertices and the mixed volume of $m$ simplices and thus shows the seemingly restrictive problem of computing mixed volume of simplices is still at least as hard as computing volumes of convex polytopes.
The asymptotic volume of the polytope of symmetric stochastic matrices can be determined by asymptotic enumeration techniques as in the case of the Birkhoff polytope. These methods can be extended to polytopes of symmetric stochastic matrices with given diagonal, if this diagonal varies not too wildly. To this end, the asymptotic number of symmetric matrices with natural entries, zero diagonal and varying row sums is determined and a third order correction factor to this is examined.
We consider the inversion enumerator I_n(q), which counts labeled trees or, equivalently, parking functions. This polynomial has a natural extension to generalized parking functions. Substituting q = -1 into this generalized polynomial produces the number of permutations with a certain descent set. In the classical case, this result implies the formula I_n(-1) = E_n, the number of alternating permutations. We give a combinatorial proof of these formulas based on the involution principle. We also give a geometric interpretation of these identities in terms of volumes of generalized chain polyto…
It is known that every integral convex polytope is unimodularly equivalent to a face of some Gorenstein Fano polytope. It is then reasonable to ask whether every normal polytope is unimodularly equivalent to a face of some normal Gorenstein Fano polytope. In the present paper, it is shown that, by giving new classes of normal Gorenstein Fano polytopes, each order polytope as well as each chain polytope of dimension $d$ is unimodularly equivalent to a facet of some normal Gorenstein Fano polytopes of dimension $d + 1$. Furthermore, investigation on combinatorial properties, especially, Ehrhart …
Adjacency polytopes appear naturally in the study of nonlinear emergent phenomena in complex networks. The "PQ-type" adjacency polytope, denoted $\nabla^{\mathrm{PQ}}_G$ and which is the focus of this work, encodes rich combinatorial information about power-flow solutions in sparse power networks that are studied in electric engineering. Of particular importance is the normalized volume of such an adjacency polytope, which provides an upper bound on the number of distinct power-flow solutions. In this article we show that the problem of computing normalized volumes for $\nabla^{\mathrm{PQ}}_G$…
Dual Mixed Volume
本文提出多面体序列的对偶混合体积有理函数，揭示其与伴随多项式、典范形式、混合细分及 Cayley 多面体的关系，并在结合多面体中再现平面 $\phi^3$ 树级标量振幅。
We investigate the complexity of counting the number of integer points in tropical polytopes, and the complexity of calculating their volume. We study the tropical analogue of the outer parallel body and establish bounds for its volume. We deduce that there is no approximation algorithm of factor $α=2^{\text{poly}(m,n)}$ for the volume of a tropical polytope given by $n$ vertices in a space of dimension $m$, unless P$=$NP. Neither is there such an approximation algorithm for counting the number of integer points in tropical polytopes described by vertices. If follows that approximating these v…
Using the Morris-Selberg Constant Term Identity, I sketch a proof of a recent conjecture by Karola Meszaros and Alejandro Morales, that I believe could be easily made fully rigorous by a sufficiently skilled and, sufficiently interested, analyst. This conjecture is an analog to the root system $D_n$ of a conjecture made in 1998 by Clara Chan, the late David P. Robbins, and David Yuen, that I proved immediately after, also using the Morris identity.
We describe the computation of polytope volumes by descent in the face lattice, its implementation in Normaliz, and the connection to reverse-lexicographic triangulations. The efficiency of the algorithm is demonstrated by several high dimensional polytopes of different characteristics. Finally, we present an application to voting theory where polytope volumes appear as probabilities of certain paradoxa.
Cayley polytopes were defined recently as convex hulls of Cayley compositions introduced by Cayley in 1857. In this paper we resolve Braun's conjecture, which expresses the volume of Cayley polytopes in terms of the number of connected graphs. We extend this result to two one-variable deformations of Cayley polytopes (which we call t-Cayley and t-Gayley polytopes), and to the most general two-variable deformations, which we call Tutte polytopes. The volume of the latter is given via an evaluation of the Tutte polynomial of the complete graph. Our approach is based on an explicit triangulation …
Lattice polytopes with the minimal volume
本文研究格多胞形体积的下界，基于Ehrhart多项式下界定理，给出使体积达到最小（即等式成立）的若干类格多胞形，并提及Pick公式在二维情形保证等式成立。
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 generalize polytopes studied by Stanley, and the consecutive coordinate polytopes of Ayyer, Josuat-Vergès, and Ramassamy. We prove an integral equivalence between these polytopes and flow polytopes of directed acyclic graphs $G$ with a Hamiltonian path, which we call spinal graphs. We show that the volume of these flow polytopes is the number of extensions …
We establish the relationship between volumes of flow polytopes associated to signed graphs and the Kostant partition function. A special case of this relationship, namely, when the graphs are signless, has been studied in detail by Baldoni and Vergne using techniques of residues. In contrast with their approach, we provide entirely combinatorial proofs inspired by the work of Postnikov and Stanley on flow polytopes. As a fascinating special family of flow polytopes, we study the Chan-Robbins-Yuen polytopes. Motivated by the beautiful volume formula $\prod_{k=1}^{n-2} Cat(k)$ for the type $A_n…
In this work, we find an explicit expression for the volume of the trace nonnegative polytope via a generalization of the Irwin-Hall distribution. This volume is an upper bound for the volume of all projected, normalized realizable spectra. We provide ancillary results on realizable trace-zero spectra and pose several problems suitable for further inquiry.
We express the matroid polytope $P_M$ of a matroid $M$ as a signed Minkowski sum of simplices, and obtain a formula for the volume of $P_M$. This gives a combinatorial expression for the degree of an arbitrary torus orbit closure in the Grassmannian $Gr_{k,n}$. We then derive analogous results for the independent set polytope and the associated flag matroid polytope of $M$. Our proofs are based on a natural extension of Postnikov's theory of generalized permutohedra.
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 related flow polytopes $\mathcal{F}_{(λ, {\bf a})}$ for each partition shape $λ$ and netflow vector ${\bf a}\in \mathbb{Z}^n_{> 0}$. In each such family, we prove that there is a polytope (the limiting one in a sense) which is a product of scaled simplices, explaining their product volumes. We also show that the combinatorial type of all polytopes in a fixed…
We present a formula for the degree of the discriminant of a smooth projective toric variety associated to a lattice polytope P, in terms of the number of integral points in the interior of dilates of faces of dimension greater or equal than $\lceil \frac {\dim P} 2 \rceil$.
Polyhedral volume ratios, Izmestiev's Colin de Verdiere matrices and Spectral Gaps
本文建立原多面体与极对偶多面体相关低维单纯形体积比关系，并将其应用于 Izmestiev 的 Colin de Verdiere 矩阵构造；同时通过随机游走矩阵研究顶点传递多面体变体的谱隙极值，证明最大谱隙对应等边多面体。
We show by a direct construction that there are at least $\exp\{cV^{(d-1)/(d+1)}\}$ convex lattice polytopes in $\mathbb{R}^d$ of volume $V$ that are different in the sense that none of them can be carried to an other one by a lattice preserving affine transformation. This is achieved by considering the family $\mathcal{P}^d(r)$ (to be defined in the text) of convex lattice polytopes whose volumes are between $0$ and $r^d/d!$. Namely we prove that for $P \in \mathcal{P}^d(r)$, $d!\mathrm{vol\;} P$ takes all possible integer values between $cr^{d-1}$ and $r^d$ where $c>0$ is a constant dependin…
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 constructions of triangulations of hypersimplices due to Stanley and Sturmfels and explain them in terms of alcoved polytopes. We study triangulations of alcoved polytopes, the adjacency graphs of these triangulations, and give a combinatorial formula for volumes of these polytopes. In particular, we study a class of matroid polytopes, which we call the multi-hypersimp…
We give an upper bound on the volume vol(P*) of a polytope P* dual to a d-dimensional lattice polytope P with exactly one interior lattice point, in each dimension d. This bound, expressed in terms of the Sylvester sequence, is sharp, and is achieved by the dual to a particular reflexive simplex. Our result implies a sharp upper bound on the volume of a d-dimensional reflexive polytope. Translated into toric geometry, this gives a sharp upper bound on the anti-canonical degree $(-K_X)^d$ of a d-dimensional toric Fano variety X with at worst canonical singularities.
Approximating the volume of a truncated relaxation of the independence polytope
针对独立集多面体松弛截断体积的近似计算问题，提出将体积视为图多项式求值、借助Barvinok插值法实现的多项式时间算法，改进了此前的拟多项式时间算法。
Deterministically approximating the volume of a Kostka polytope
本文提出了一种多项式时间确定性算法，用于近似Kostka多面体的体积，其乘法因子为exp(O(n log n))，并基于连续Schur多项式的一个连续类别的分区函数解释。
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。