Related papers: A Deterministic Algorithm of Quasi-Polynomial Comp…
Generically, a fully measured elasticity tensor has no material symmetry. For single crystals with a cubic lattice, or for the aeronautics turbine blades superalloys such as Nickelbased CMSX-4, cubic symmetry is nevertheless expected. It is…
The purpose of this paper is to study some new concrete approximation processes for continuous vector-valued mappings defined on the infinite dimensional cube or on a subset of a real Hilbert space. In both cases these operators are…
Paralleling our recent computationally-intensive 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) for the…
We study the problem of finding the Lowner-John ellipsoid, i.e., an ellipsoid with minimum volume that contains a given convex set. We reformulate the problem as a generalized copositive program, and use that reformulation to derive…
This paper considers the question of how to succinctly approximate a multidimensional convex body by a polytope. Given a convex body $K$ of unit diameter in Euclidean $d$-dimensional space (where $d$ is a constant) and an error parameter…
We present a novel feasibility criteria for the finite intersection of convex sets given by inequalities. This criteria allows us to easily assert the feasibility by analyzing the unconstrained minimum of a speci?fic convex function, that…
Halfspace (or Tukey) depth is a fundamental and robust measure of centrality of data points in multivariate datasets. Computing the depth of a point with respect to the uniform distribution on an open convex body in $\mathbb{R}^d$ is a…
A surprising 'converse to the polynomial method' of Aaronson et al. (CCC'16) shows that any bounded quadratic polynomial can be computed exactly in expectation by a 1-query algorithm up to a universal multiplicative factor related to the…
We investigate the intersection body of a convex polytope using tools from combinatorics and real algebraic geometry. In particular, we show that the intersection body of a polytope is always a semialgebraic set and provide an algorithm for…
In a given hypercube, draw grid lines parallel to the edges, and consider all hypercuboids (or hypercubes) whose edges are lying on the grid lines or the boundary. We find the limit of the value of the ratio of the arithmetic mean of the…
Building on the blueprint from Goemans and Williamson (1995) for the Max-Cut problem, we construct a polynomial-time approximation algorithm for orthogonally constrained quadratic optimization problems. First, we derive a semidefinite…
Quasifuchsian hyperbolic manifolds, or more generally convex co-compact hyperbolic manifolds, have infinite volume, but they have a well-defined ``renormalized'' volume. We outline some relations between this renormalized volume and the…
We give a new complexity bound for calculating the complex dimension of an algebraic set. Our algorithm is completely deterministic and approaches the best recent randomized complexity bounds. We also present some new, significantly sharper…
This paper discusses a methodology for determining a functional representation of a random process from a collection of scattered pointwise samples. The present work specifically focuses onto random quantities lying in a high dimensional…
Let $p$ and $q$ be two imprecise points, given as probability density functions on $\mathbb R^2$, and let $\cal R$ be a set of $n$ line segments (obstacles) in $\mathbb R^2$. We study the problem of approximating the probability that $p$…
We establish efficient approximate counting algorithms for several natural problems in local lemma regimes. In particular, we consider the probability of intersection of events and the dimension of intersection of subspaces. Our approach is…
In this note, we assess the accuracy of CLT-based approximations for the volume of intersection of the $d$-dimensional cube $[-1,1]^d$ and an $L_q$-ball centred at the origin; this is clearly equivalent to approximating the distribution of…
Estimating the volume of a convex body is a canonical problem in theoretical computer science. Its study has led to major advances in randomized algorithms, Markov chain theory, and computational geometry. In particular, determining the…
The (complex) two-qubit systems comprise a 15-dimensional convex set and the real two-qubit systems, a 9-dimensional convex set. While formulas for the Hilbert-Schmidt volumes of these two sets are known -- owing to recent important work of…
Union volume estimation is a classical algorithmic problem. Given a family of objects $O_1,\ldots,O_n \subseteq \mathbb{R}^d$, we want to approximate the volume of their union. In the special case where all objects are boxes (also known as…