Related papers: Experimental validation of volume-based comparison…
There are already quite a few tools for solving the Satisfiability Modulo Theories (SMT) problems. In this paper, we present \texttt{VolCE}, a tool for counting the solutions of SMT constraints, or in other words, for computing the volume…
Many classical geometric inequalities on functionals of convex bodies depend on the dimension of the ambient space. We show that this dimension dependence may often be replaced (totally or partially) by different symmetry measures of the…
We experimentally study the fundamental problem of computing the volume of a convex polytope given as an intersection of linear inequalities. We implement and evaluate practical randomized algorithms for accurately approximating the…
Weil-Petersson and Masur-Veech volumes measure the sizes of moduli spaces of Riemann surfaces equipped with hyperbolic and flat metrics, respectively. Over the past several decades, the computation of these volumes has inspired remarkable…
Intrinsic volumes are fundamental geometric invariants generalizing volume, surface area, and mean width for convex bodies. We establish a unified Laplace-Grassmannian representation for intrinsic and dual volumes of convex polynomial…
The present paper considers volume formulae, as well as trigonometric identities, that hold for a tetrahedron in 3-dimensional spherical space of constant sectional curvature +1. The tetrahedron possesses a certain symmetry: namely rotation…
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…
We derive a simple analytical line integral expression for the relaxation volume tensor of an arbitrary interconnected dislocation network. This quantity determines the magnitude of dislocation contribution to the dimensional changes and…
We consider the volume of a Boolean expression of some congruent balls about a given system of centers in the $d$-dimensional Euclidean space. When the radius $r$ of the balls is large, this volume can be approximated by a polynomial of…
We consider the computation of the volume of the union of high-dimensional geometric objects. While showing that this problem is #P-hard already for very simple bodies (i.e., axis-parallel boxes), we give a fast FPRAS for all objects where…
Convex hulls of monomials have been widely studied in the literature, and monomial convexifications are implemented in global optimization software for relaxing polynomials. However, there has been no study of the error in the global…
We construct a quasi-polynomial time deterministic approximation algorithm for computing the volume of an independent set polytope with restrictions. Randomized polynomial time approximation algorithms for computing the volume of a convex…
Relaxation volume tensors quantify the effect of stress on diffusion of crystal defects. Continuum linear elasticity predicts that calculations of these parameters using periodic boundary conditions do not suffer from systematic deviations…
In convex geometry, the Shapley-Folkman Lemma asserts that the nonconvexity of a Minkowski sum of $n$ dimensional bounded nonconvex sets does not accumulate once the number of summands exceeds the dimension $n$, and thus the sum becomes…
Volume estimates of metric balls in manifolds find diverse applications in information and coding theory. In this paper, some new results for the volume of a metric ball in unitary group are derived via various tools from random matrix…
Based on observations of points uniformly distributed over a convex set in $\R^d$, a new estimator for the volume of the convex set is proposed. The estimator is minimax optimal and also efficient non-asymptotically: it is nearly unbiased…
Let $K$ be a $d$ dimensional convex body with a twice continuously differentiable boundary and everywhere positive Gauss-Kronecker curvature. Denote by $K_n$ the convex hull of $n$ points chosen randomly and independently from $K$ according…
We investigate new convex relaxations for the pooling problem, a classic nonconvex production planning problem in which input materials are mixed in intermediate pools, with the outputs of these pools further mixed to make output products…
The goal of this paper is to present a lower bound for the Mahler volume of at least 4-dimensional symmetric convex bodies. We define a computable dimension dependent constant through a 2-dimensional variational (max-min) procedure and…
Several fundamental problems that arise in optimization and computer science can be cast as follows: Given vectors $v_1,\ldots,v_m \in \mathbb{R}^d$ and a constraint family ${\cal B}\subseteq 2^{[m]}$, find a set $S \in \cal{B}$ that…