English
Related papers

Related papers: Proof of Dudley's Convex Approximation

200 papers

Let $P$ and $Q$ be two simple polygons in the plane of total complexity $n$, each of which can be decomposed into at most $k$ convex parts. We present an $(1-\varepsilon)$-approximation algorithm, for finding the translation of $Q$, which…

Computational Geometry · Computer Science 2014-06-24 Sariel Har-Peled , Subhro Roy

Suppose we choose $N$ points uniformly randomly from a convex body in $d$ dimensions. How large must $N$ be, asymptotically with respect to $d$, so that the convex hull of the points is nearly as large as the convex body itself? It was…

Probability · Mathematics 2020-09-22 Alan Frieze , Wesley Pegden , Tomasz Tkocz

We prove a weak version of the $\varepsilon$-Dvoretzky conjecture for normed spaces, showing the existence of a subspace of $\mathbb{R}^n$ of dimension at least $c \log n / |\log \varepsilon|$ in which the given norm is $\varepsilon$-close…

Functional Analysis · Mathematics 2023-07-28 Bo'az Klartag , Tomer Novikov

This short article serves as the appendix for [Tran and Wang, 2022]. We prove that a complete intersection of $n$ generic polyhedral hypersurfaces in $\mathbb{R}^d$ is $(d-n-1)$-connected for $d\geq 2, d>n$.

Combinatorics · Mathematics 2023-06-28 Jidong Wang

A partition $\mathcal{P}$ of $\mathbb{R}^d$ is called a $(k,\varepsilon)$-secluded partition if, for every $\vec{p} \in \mathbb{R}^d$, the ball $\overline{B}_{\infty}(\varepsilon, \vec{p})$ intersects at most $k$ members of $\mathcal{P}$. A…

Computational Complexity · Computer Science 2023-04-12 Jason Vander Woude , Peter Dixon , A. Pavan , Jamie Radcliffe , N. V. Vinodchandran

Polytopes are the basic finite data structures for convex sets: they appear as feasible regions in linear optimization, as geometric summaries in algorithms, and as random objects in stochastic geometry. A natural geometric question is…

Metric Geometry · Mathematics 2026-03-10 Steven Hoehner

The approximability of a convex body is a number which measures the difficulty to approximate that body by polytopes. We prove that twice the approximability is equal to the volume entropy for a Hilbert geometry in dimension two end three…

Metric Geometry · Mathematics 2017-03-01 Constantin Vernicos

Approximate a smooth convex body $K$ with nonvanishing curvature by the convex hull of $n$ independent random points sampled from its boundary $\partial K$. In case the points are distributed according to the optimal density, we prove that…

Probability · Mathematics 2025-08-25 Mathias Sonnleitner

Let $C\subset \mathbb{S}^2$ be a spherical convex body of constant width $\tau$. It is known that (i) if $\tau<\pi/2$ then for any $\varepsilon>0$ there exists a spherical convex body $C_\varepsilon$ of constant width $\tau$ whose boundary…

Metric Geometry · Mathematics 2025-04-01 Huhe Han

In 1957, Hadwiger conjectured that every convex body in $\mathbb{R}^d$ can be covered by $2^d$ translates of its interior. For over 60 years, the best known bound was of the form $O(4^d \sqrt{d} \log d)$, but this was recently improved by a…

Metric Geometry · Mathematics 2022-06-23 Marcelo Campos , Peter van Hintum , Robert Morris , Marius Tiba

We show that any point in the convex hull of each of (d+1) sets of (d+1) points in general position in \R^d is contained in at least (d+1)^2/2 simplices with one vertex from each set. This improves the known lower bounds for all d >= 4.

Combinatorics · Mathematics 2010-06-01 Antoine Deza , Tamon Stephen , Feng Xie

Many star bodies have convex subsets with approximately the same Gaussian measure (of the complement). Inspired by this phenomenon, and in connection with the randomized Dvoretzky theorem for Lorentz spaces, we derive bounds on the…

Functional Analysis · Mathematics 2022-06-22 Daniel J. Fresen

We improve our earlier upper bound on the numbers of antipodal pairs of points among $n$ points in ${\mathbb{R}}^3$, to $2n^2/5+O(n^c)$, for some $c<2$. We prove that the minimal number of antipodal pairs among $n$ points in convex position…

Combinatorics · Mathematics 2021-06-03 E. Makai , H. Martini , M. H. Nguyên , V. Soltan , I. Talata

This paper is motivated by Davenport's problem and the subsequent work regarding badly approximable points in submanifolds of a Euclidian space. We study the problem in the area of twisted Diophantine approximation and present two different…

Number Theory · Mathematics 2017-05-17 Paloma Bengoechea , Nikolay Moshchevitin , Natalia Stepanova

We show that learning a convex body in $\RR^d$, given random samples from the body, requires $2^{\Omega(\sqrt{d/\eps})}$ samples. By learning a convex body we mean finding a set having at most $\eps$ relative symmetric difference with the…

Machine Learning · Computer Science 2009-04-09 Navin Goyal , Luis Rademacher

Suppose $d+1$ absolutely continuous probability measures $m_0, \ldots, m_d$ on $\mathbb{R}^d$ are given. In this paper, we prove that there exists a point of $\mathbb{R}^d$ that belongs to the convex hull of $d+1$ points $v_0, \ldots, v_d$…

Combinatorics · Mathematics 2020-06-03 Zilin Jiang

The approximate Carath\'eodory problem in general form is as follows: Given two symmetric convex bodies $P,Q \subseteq \mathbb{R}^m$, a parameter $k \in \mathbb{N}$ and $\mathbf{z} \in \textrm{conv}(X)$ with $X \subseteq P$, find…

Metric Geometry · Mathematics 2022-10-31 Victor Reis , Thomas Rothvoss

It is proved that if $u_1,\ldots, u_n$ are vectors in ${\Bbb R}^k, k\le n, 1 \le p < \infty$ and $$r = ({1\over k} \sum ^n_1 |u_i|^p)^{1\over p}$$ then the volume of the symmetric convex body whose boundary functionals are $\pm u_1,\ldots,…

Metric Geometry · Mathematics 2016-09-06 Keith Ball , Alain Pajor

Let $M$ be a compact $n$-dimensional Riemannian manifold with nonnegative Ricci curvature and mean convex boundary $\partial M$. Assume that the mean curvature $H$ of the boundary $\partial M$ satisfies $H \geq (n-1) k >0$ for some positive…

Differential Geometry · Mathematics 2020-01-06 Martin Li

Let $\gamma^d_m(K)$ be the smallest positive number $\lambda$ such that the convex body $K$ can be covered by $m$ translates of $\lambda K$. Let $K^d$ be the $d$-dimensional crosspolytope. It will be proved that $\gamma^d_m(K^d)=1$ for…

Metric Geometry · Mathematics 2023-05-24 Antal Joós