Related papers: Computing the Volume of Polytropes

The "Mahler volume" is, intuitively speaking, a measure of how "round" a centrally symmetric convex body is. In one direction this intuition is given weight by a result of Santalo, who in the 1940s showed that the Mahler volume is…

In spite of considerable progress, computing curvature in Volume of Fluid (VOF) methods continues to be a challenge. The goal is to develop a function or a subroutine that returns the curvature in computational cells containing an interface…

In this article we introduce the recently developed polymake extension TropicalQuarticCurves and its associated database entry in polyDB dealing with smooth tropical quartic curves. We report on algorithms implemented to analyze tropical…

We establish central limit theorems for natural volumes of random inscribed polytopes in projective Riemannian or Finsler geometries. In addition, normal approximation of dual volumes and the mean width of random polyhedral sets are…

We present a particle method for estimating the curvature of interfaces in volume-of-fluid simulations of multiphase flows. The method is well suited for under-resolved interfaces, and it is shown to be more accurate than the parabolic…

We fix the supports A=(A_1,...,A_k) of a list of tropical polynomials and define the tropical resultant TR(A) to be the set of choices of coefficients such that the tropical polynomials have a common solution. We prove that TR(A) is the…

Techniques for computing the CMBR anisotropy from simulations of topological defects are discussed with an eye to getting as much information from a simulation as possible. Here we consider the practical details of which sums and…

A well-known result in the study of convex polyhedra, due to Minkowski, is that a convex polyhedron is uniquely determined (up to translation) by the directions and areas of its faces. The theorem guarantees existence of the polyhedron…

We calculate the volumes of the hyperbolic twist knot cone-manifolds using the Schl\"{a}fli formula. Even though general ideas for calculating the volumes of cone-manifolds are around, since there is no concrete calculation written, we…

The face lattice of the permutohedron realizes the combinatorics of linearly ordered partitions of the set $[n]=\{1,...,n\}$. Similarly, the cyclopermutohedron is a virtual polytope that realizes the combinatorics of cyclically ordered…

Speakman and Lee (2017) gave a formula for the volume of the convex hull of the graph of a trilinear monomial, $y=x_1x_2x_3$, over a box in the nonnegative orthant, in terms of the upper and lower bounds on the variables. This was done in…

We study the problem of counting lattice points of a polytope that are weighted by an Ehrhart quasi-polynomial of a family of parametric polytopes. As applications one can compute integrals and maximum values of such quasi-polynomials, as…

We derive an explicit formula for the volume of a regular simplex in the hyperbolic space of any dimension.

The volume and the number of lattice points of the permutohedron P_n are given by certain multivariate polynomials that have remarkable combinatorial properties. We give several different formulas for these polynomials. We also study a more…

We present an algorithm for the classification of triples of lattice polytopes with a given mixed volume $m$ in dimension 3. It is known that the classification can be reduced to the enumeration of so-called irreducible triples, the number…

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…

The Ehrhart polynomial of an integral convex polytope counts the number of lattice points in dilates of the polytope. In math.CO/0402148, the authors conjectured that for any cyclic polytope with integral parameters, the Ehrhart polynomial…

We use machine learning to predict the dimension of a lattice polytope directly from its Ehrhart series. This is highly effective, achieving almost 100% accuracy. We also use machine learning to recover the volume of a lattice polytope from…

In this paper, we generalize the result on the average volume of random polytopes with vertices following beta distributionsto the case of non-identically distributed vectors. Specifically,we consider the convex hull of independent random…

Sampling from high dimensional distributions and volume approximation of convex bodies are fundamental operations that appear in optimization, finance, engineering, artificial intelligence and machine learning. In this paper we present…