Related papers: Different Volume Computation Methods of Graph Poly…
We study the problem of approximating the mixed volume $V(P_1^{(\alpha_1)}, \dots, P_k^{(\alpha_k)})$ of an $k$-tuple of convex polytopes $(P_1, \dots, P_k)$, each of which is defined as the convex hull of at most $m_0$ points in…
Every generic linear functional $f$ on a convex polytope $P$ induces an orientation on the graph of $P$. From the resulting directed graph one can define a notion of $f$-arborescence and $f$-monotone path on $P$, as well as a natural graph…
We give upper bounds for volume of sublevel sets of real polynomials. Our method is to combine a version of global Lojasiewicz inequality with some well known estimate on volume of tubes around real algebraic sets. Some applications to…
Short and transparent proofs of central limit theorems for intrinsic volumes of random polytopes in smooth convex bodies are presented. They combine different tools such as estimates for floating bodies with Stein's method from probability…
We give an Eynard-Orantin type topological recursion formula for the canonical Euclidean volume of the combinatorial moduli space of pointed smooth algebraic curves. The recursion comes from the edge removal operation on the space of ribbon…
We propose to differentiate a general curvature functional with two different approaches. In the first one we compute the derivative with the tools of shape optimization and in the second one we compute the derivative of a volumic…
The volume of a cyclic polytope can be obtained by forming an iterated integral along a suitable piecewise linear path running through its edges. Different choices of such a path are related by the action of a subgroup of the combinatorial…
A special homotopy continuation method, as a combination of the polyhedral homotopy and the linear product homotopy, is proposed for computing all the isolated solutions to a special class of polynomial systems. The root number bound of…
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…
A second-order accurate and robust numerical scheme is developed for the Kapila model to simulate compressible multiphase flows. The scheme is formulated within the finite volume framework with the generalized Riemann problem (GRP) solver…
A number theoretic algorithm is given for writing gauge theory amplitudes in a compact manner. It is possible to write down all details of the complete $L$ loop amplitude with two integers, or a complex integer. However, a more symmetric…
This paper collects some important formulas on hyperbolic volume. To determine concrete values of volume function is a very hard question requiring the knowledge of various methods. Our goal to give a non-elementary integral on the volume…
A new PLIC (piecewise linear interface calculation)-type VOF (volume of fluid) method, called APPLIC (approximated PLIC) method, is presented. Although the PLIC method is one of the most accurate VOF methods, the three-dimensional algorithm…
The stochastic finite volume method (SFV method) is a high-order accurate method for uncertainty quantification (UQ) in hyperbolic conservation laws. However, the computational cost of SFV method increases for high-dimensional stochastic…
We study the connections between volume growth, spectral properties and stochastic completeness of locally finite graphs. For a class of graphs with a very weak spherical symmetry we give a condition which implies both stochastic…
A calculation formula of volume of revolution with integration by parts of definite integral is derived based on monotone function, and extended to a general case that curved trapezoids is determined by continuous, piecewise strictly…
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…
We present an explicit closed-form formula for the vertices of the classical cut polytope $\operatorname{CUT}(n)$, defined as the convex hull of cut vectors of the complete graph $K_n$. Our derivation proceeds via a related polytope,…
Graph polynomials encode fundamental combinatorial invariants of graphs. Their computation is investigated using tree and path decomposition frameworks, with formal definitions of treewidth, k-trees, and pathwidth establishing the…
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…