Related papers: Experimental validation of volume-based comparison…
An example of the volume and boundary face area of a curved polyhedron for the case of regular spherical and hyperbolic tetrahedron is discussed. An exact formula is explicitly derived as a function of the scalar curvature and the edge…
We present an efficient framework for solving algebraically-constrained global non-convex polynomial optimization problems over subsets of the hypercube. We prove the existence of an equivalent nonlinear reformulation of such problems that…
We consider the problem of estimating the volume of a compact domain in a Euclidean space based on a uniform sample from the domain. We assume the domain has a boundary with positive reach. We propose a data splitting approach to correct…
Polymers are an effective test-bed for studying topological constraints in condensed matter due to a wide array of synthetically-available chain topologies. When linear and ring polymers are blended together, emergent rheological properties…
Connecting cosmological simulations to real-world observational programs is often complicated by a mismatch in geometry: while surveys often cover highly irregular cosmological volumes, simulations are customarily performed in a periodic…
The pooling problem is a classical NP-hard problem in the chemical process and petroleum industries. This problem is modeled as a nonlinear, nonconvex network flow problem in which raw materials with different specifications are blended in…
When a thin sheet is crushed into a small three-dimensional volume, it invariably forms a structure with a low volume fraction but high resistance to further compression. Being a far-from-equilibrium process, forced crumpling is not…
In this paper, we give a definition of volume for subsets in the space of arcs of an algebraic variety, and study its properties. Our main result relates the volume of a set of arcs on a Cohen-Macaulay variety to its jet-codimension, a…
Semidefinite relaxations are widely used to compute upper bounds on the objective of optimization problems involving noncommutative polynomials. Such optimization problems are prevalent in quantum information. We present an algorithm able…
We study the space complexity of the following problem: For a fixed regular language $L$, we receive a stream of symbols and want to test membership of a sliding window of size $n$ in $L$. For deterministic streaming algorithms we prove a…
A great variety of fundamental optimization and counting problems arising in computer science, mathematics and physics can be reduced to one of the following computational tasks involving polynomials and set systems: given an $m$-variate…
Macdonald studied a discrete volume measure for a rational polytope $P$, called solid angle sum, that gives a natural discrete volume for $P$. We give a local formula for the codimension two quasi-coefficient of the solid angle sum of $P$.…
The KLEE'S MESURE of $n$ axis-parallel boxes in $\mathbb{R}^d$ is the volume of their union. It can be computed in time within $O(n^{d/2})$ in the worst case. We describe three techniques to boost its computation: one based on some type of…
The classical Dvoretzky--Rogers lemma provides a deterministic algorithm by which, from any set of isotropic vectors in Euclidean $d$-space, one can select a subset of $d$ vectors whose determinant is not too small. Subsequently,…
We consider the problem of approximating a semialgebraic set with a sublevel-set of a polynomial function. In this setting, it is standard to seek a minimum volume outer approximation and/or maximum volume inner approximation. As there is…
For n greater than or equal to 4, the square of the volume of an n-simplex satisfies a polynomial relation with coefficients depending on the squares of the areas of 2-faces of this simplex. First, we compute the minimal degree of such…
In this note we describe experiments on an implementation of two methods proposed in the literature for computing regions that correspond to a notion of order statistics for multidimensional data. Our implementation, which works for any…
The level of a function f on an n-dimensional space encloses a region. The volume of a region between two such levels depends on both levels. Fixing one of them the volume becomes a function of the remaining level. We show that if the…
We endeavour to estimate numerous multi-dimensional means of various probability distributions on a common space based on independent samples. Our approach involves forming estimators through convex combinations of empirical means derived…
We consider the problem of computing the Lebesgue volume of compact basic semi-algebraic sets. In full generality, it can be approximated as closely as desired by a converging hierarchy of upper bounds obtained by applying the Moment-SOS…