Related papers: Reducing Isotropy and Volume to KLS: Faster Roundi…
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…
Let $K \subset \mathbb R^n$ be a convex body with barycenter at the origin. We show there is a simplex $S \subset K$ having also barycenter at the origin such that $\left(\frac{vol(S)}{vol(K)}\right)^{1/n} \geq \frac{c}{\sqrt{n}},$ where…
Let $\Omega$ be a bounded closed convex set in ${\mathbb R}^d$ with non-empty interior, and let ${\cal C}_r(\Omega)$ be the class of convex functions on $\Omega$ with $L^r$-norm bounded by $1$. We obtain sharp estimates of the…
We obtain a new extension of Rogers-Shephard inequality providing an upper bound for the volume of the sum of two convex bodies $K$ and $L$. We also give lower bounds for the volume of the $k$-th limiting convolution body of two convex…
The average section functional ${\rm as}(K)$ of a centered convex body in ${\mathbb R}^n$ is the average volume of central hyperplane sections of $K$: \begin{equation*}{\rm as}(K)=\int_{S^{n-1}}|K\cap \xi^{\perp }|\,d\sigma (\xi…
We give a novel algorithm for enumerating lattice points in any convex body, and give applications to several classic lattice problems, including the Shortest and Closest Vector Problems (SVP and CVP, respectively) and Integer Programming…
Recent results suggest that quantum computers possess the potential to speed up nonconvex optimization problems. However, a crucial factor for the implementation of quantum optimization algorithms is their robustness against experimental…
We study the algorithmic problem of estimating the mean of heavy-tailed random vector in $\mathbb{R}^d$, given $n$ i.i.d. samples. The goal is to design an efficient estimator that attains the optimal sub-gaussian error bound, only assuming…
In the first part of this paper, we develop the theory of anisotropic curvature measures for convex bodies in the Euclidean space. It is proved that any convex body whose boundary anisotropic curvature measure equals a linear combination of…
We introduce a novel algorithm, $\textit{COD}$ -- Compact Opacity Distribution, for shape reconstruction of a celestial body that has been observed to occult a star, using the photometric time-series observations of the occultation.…
We have derived an analytical formulation for estimating the volume of geometries enclosed by implicitly defined surfaces. The novelty of this work is due to two aspects. First we provide a general analytical formulation for all…
Motivated by understanding the quality of tractable convex relaxations of intractable polytopes, Ko et al. gave a closed-form expression for the volume of a standard relaxation $\mathscr{Q}(G)$ of the boolean quadric polytope (also known as…
Kernel quadrature can exploit RKHS spectral structure and outperform Monte Carlo on smooth integrands, but optimized quadrature weights are generally signed and may be numerically unstable. We study whether spectral acceleration remains…
The isodiametric inequality states that the Euclidean ball maximizes the volume among all convex bodies of a given diameter. We are motivated by a conjecture of Makai Jr.~on the reverse question: Every convex body has a linear image whose…
Let $P$ be a set of $n$ points in the plane. We compute the value of $\theta\in [0,2\pi)$ for which the rectilinear convex hull of $P$, denoted by $\mathcal{RH}_\theta(P)$, has minimum (or maximum) area in optimal $O(n\log n)$ time and…
A classic theorem of Kazhdan and Margulis states that for any semisimple Lie group without compact factors, there is a positive lower bound on the covolume of lattices. H. C. Wang's subsequent quantitative analysis showed that the…
We present a software suite for the analysis and optimization of ideal convex polyhedra in hyperbolic 3-space $\mathbb{H}^3$. Using Rivin's variational characterization of ideal polyhedra, we develop efficient algorithms for checking…
Let $K$ be a centrally-symmetric convex body in $\mathbb{R}^n$ and let $\|\cdot\|$ be its induced norm on ${\mathbb R}^n$. We show that if $K \supseteq r B_2^n$ then: \[ \sqrt{n} M(K) \leqslant C \sum_{k=1}^{n} \frac{1}{\sqrt{k}}…
We establish estimates for the asymptotic best approximation of the Euclidean unit ball by polytopes under a notion of distance induced by the intrinsic volumes. We also introduce a notion of distance between convex bodies that is induced…
We study the volume ratio between projections of two convex bodies. Given a high-dimensional convex body $K$ we show that there is another convex body $L$ such that the volume ratio between any two projections of fixed rank of the bodies…