Related papers: A Deterministic Algorithm of Quasi-Polynomial Comp…
The computational complexity of some depths that satisfy the projection property, such as the halfspace depth or the projection depth, is known to be high, especially for data of higher dimensionality. In such scenarios, the exact depth is…
We discuss an algorithm for Tchakaloff-like compression of Quasi-MonteCarlo (QMC) volume/surface integration on union of balls (multibubbles). The key tools are Davis-Wilhelmsen theorem on the so-called Tchakaloff sets for positive linear…
We give a deterministic polynomial-time approximation scheme (FPTAS) for the volume of the truncated fractional matching polytope for graphs of maximum degree $\Delta$, where the truncation is by restricting each variable to the interval…
We present several examples of quasi-exactly solvable $N$-body problems in one, two and higher dimensions. We study various aspects of these problems in some detail. In particular, we show that in some of these examples the corresponding…
Mixtures of hard hyperspheres in odd space dimensionalities are studied with an analytical approximation method. This technique is based on the so-called Rational Function Approximation and provides a procedure for evaluating equations of…
In this note we give sharp estimates on the volume of the set of separable states on N qubits. In particular, the magnitude of the "effective radius" of that set in the sense of volume is determined up to a factor which is a (small) power…
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 describe a maximum entropy approach for computing volumes and counting integer points in polyhedra. To estimate the number of points from a particular set X in R^n in a polyhedron P in R^n, by solving a certain entropy maximization…
We provide closed-form expressions for the first moments (i.e., the volume and volume-weighted centroid) of a polyhedron clipped by a paraboloid, that is, of a polyhedron intersected with the subset of the three-dimensional real space…
We study the geometric knapsack problem in which we are given a set of $d$-dimensional objects (each with associated profits) and the goal is to find the maximum profit subset that can be packed non-overlappingly into a given…
We study best approximation to a given function, in the least square sense on a subset of the unit circle, by polynomials of given degree which are pointwise bounded on the complementary subset. We show that the solution to this problem, as…
The problem of finding a point in the intersection of closed sets can be solved by the method of alternating projections and its variants. It was shown in earlier papers that for convex sets, the strategy of using quadratic programming (QP)…
Let $\D$ be a set of $n$ pairwise disjoint unit balls in $\R^d$ and $P$ the set of their center points. A hyperplane $\Hy$ is an \emph{$m$-separator} for $\D$ if each closed halfspace bounded by $\Hy$ contains at least $m$ points from $P$.…
Let ${\bf K} = (K_1, ..., K_n)$ be an $n$-tuple of convex compact subsets in the Euclidean space $\R^n$, and let $V(\cdot)$ be the Euclidean volume in $\R^n$. The Minkowski polynomial $V_{{\bf K}}$ is defined as $V_{{\bf K}}(\lambda_1, ...…
Paralleling our recent computationally-intensive (quasi-Monte Carlo) work for the case N=4 (quant-ph/0308037), we undertake the task for N=6 of computing to high numerical accuracy, the formulas of Sommers and Zyczkowski (quant-ph/0304041)…
W. Thurston suggested a method for computing hyperbolic volume of hyperbolic 3-manifolds, based on a triangulation of the manifold. The method was implemented by J. Weeks in the program SnapPea, which produces a decimal approximation as a…
An almost-toric hypersurface is parameterized by monomials multiplied by polynomials in one extra variable. We determine the Newton polytope of such a hypersurface, and apply this to give an algorithm for computing the implicit equation.
This paper presents a framework for abstracting uncertain or non-polynomial components of dynamical systems using polynomial constraints. This enables the application of polynomial-based analysis tools, such as sum-of-squares programming,…
Volume approximation is an important problem found in many applications of computer graphics, vision, and image processing. The problem is about computing an accurate and compact approximate representation of 3D volumes using some simple…
We present exact expressions for the sum of states of noninteracting classical and quantum particles occupying a finite number of modes with arbitrary spacings. Exploiting a probabilistic analogy, we derive an analytic fourth-order…