Related papers: Experimental validation of volume-based comparison…

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…

We present a hierarchy of tractable relaxations to obtain lower bounds on the minimum value of a polynomial over a constraint set defined by polynomial equations. In contrast to previous convex relaxation techniques for this problem, our…

Relaxation theorems which apply to one, two and three-dimensional nonlinear elasticity are proved. We take into account the fact an infinite amount of energy is required to compress a finite line, surface or volume into zero line, surface…

We study the minimum volume ellipsoid estimator associates to a cloud of points in phase space. Using as a natural measure of uncertainty the symplectic capacity of the covariance ellipsoid we find that classical uncertainties obey…

The problem of estimating, from a random sample of points, the dimension of a compact subset $S$ of the Euclidean space is considered. The emphasis is put on consistency results in the statistical sense. That is, statements of convergence…

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…

We determine the minimal volume of a stable surface of rank one, and show that the surface attaining this minimum is unique up to isomorphism. This resolves a conjecture of Alexeev and the second author. Of independent interest, the…

The Loomis-Whitney inequality states that the volume of a convex body is bounded by the product of volumes of its projections onto orthogonal hyperplanes. We provide an extension of both this fact and a generalization of this fact due to…

The present paper gives two concrete formulas for the volume of an arbitrary spherical tetrahedron, which is in a 3-dimensional spherical space of constant curvature +1. One formula is given in terms of dihedral angles, and another one is…

The volume of a Meissner polyhedron is computed in terms of the lengths of its dual edges. This allows to reformulate the Meissner conjecture regarding constant width bodies with minimal volume as a series of explicit finite dimensional…

Some methods based on simple regularizing geometric element transformations have heuristically been shown to give runtime efficient and quality effective smoothing algorithms for meshes. We describe the mathematical framework and a…

Let $P_1,\dots, P_n$ and $Q_1,\dots, Q_n$ be convex polytopes in $\mathbb{R}^n$ such that $P_i\subset Q_i$. It is well-known that the mixed volume has the monotonicity property: $V(P_1,\dots,P_n)\leq V(Q_1,\dots,Q_n)$. We give two criteria…

We consider the volume expansion of the Blaschke metric, which is a projectively invariant metric on a strictly convex domain in a locally flat projective manifold. When the boundary is even dimensional, we express the logarithmic…

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…

In this work we bring together tools and ideology from two different fields, Symplectic Geometry and Asymptotic Geometric Analysis, to arrive at some new results. Our main result is a dimension-independent bound for the symplectic capacity…

We consider optimization problems with polynomial inequality constraints in non-commuting variables. These non-commuting variables are viewed as bounded operators on a Hilbert space whose dimension is not fixed and the associated polynomial…

It is evident that the positions of 4 bodies in $d>2$ dimensional space can be identified with vertices of a tetrahedron. Square of volume of the tetrahedron, weighted sum of squared areas of four facets and weighted sum of squared edges…

The calculation of volumes of polyhedra in the three-dimensional Euclidean, spherical and hyperbolic spaces is very old and difficult problem. In particular, an elementary formula for volume of non-euclidean simplex is still unknown. One of…

With the recent advent of a sound mathematical theory for extreme events in dynamical systems, new ways of analyzing a system's inherent properties have become available: Studying only the probabilities of extremely close Poincar\'{e}…

In the course of classifying generic sparse polynomial systems which are solvable in radicals, Esterov recently showed that the volume of the Minkowski sum $P_1+\dots+P_d$ of $d$-dimensional lattice polytopes is bounded from above by a…