English
Related papers

Related papers: Approximation of smooth convex bodies by random po…

200 papers

Let $K$ be a smooth convex set with volume one in $\BBR^d$. Choose $n$ random points in $K$ independently according to the uniform distribution. The convex hull of these points, denoted by $K_n$, is called a {\it random polytope}. We prove…

Probability · Mathematics 2007-05-23 Van Vu

Giving a joint generalization of a result of Brazitikos, Chasapis and Hioni and results of Giannopoulos and Milman, we prove that roughly $\left\lceil \frac{d}{(1-\vartheta)^d}\ln\frac{1}{(1-\vartheta)^d} \right\rceil$ points chosen…

Metric Geometry · Mathematics 2017-05-23 Márton Naszódi

It was shown in [11] that for every origin-symmetric star body $K \subseteq \mathbb R^n$ of volume $1$, every even continuous probability density $f$ on $K$ and $1 \leq k \leq n-1$, there exists a subspace $F \subseteq \mathbb R^n$ of…

Metric Geometry · Mathematics 2024-11-07 J. Haddad

We consider the problem of minimizing a continuous function f over a compact set K. We analyze a hierarchy of upper bounds proposed by Lasserre in [SIAM J. Optim. 21(3) (2011), pp. 864--885], obtained by searching for an optimal probability…

Optimization and Control · Mathematics 2015-09-09 Etienne de Klerk , Monique Laurent , Zhao Sun

For a function $f$, continuous on a compact convex set $K$ and analytic in its interior we construct a sequence of almost optimal polynomials that converge with a geometric rate at points of analyticity of $f$.

Complex Variables · Mathematics 2022-10-19 Liudmyla Kryvonos

We show that for any compact convex set $K$ in $\mathbb{R}^d$ and any finite family $\mathcal{F}$ of convex sets in $\mathbb{R}^d$, if the intersection of every sufficiently small subfamily of $\mathcal{F}$ contains an isometric copy of $K$…

Metric Geometry · Mathematics 2020-10-09 John A. Messina , Pablo Soberón

Approximating convex bodies is a fundamental problem in geometry. Given a convex body $K$ in $\mathbb{R}^d$ for a fixed dimension $d$, the objective is to minimize the number of facets of an approximating polytope for a given Hausdorff…

Computational Geometry · Computer Science 2026-01-26 Sunil Arya , Guilherme D. da Fonseca , David M. Mount

In the paper "Isoperimetry of waists and local versus global asymptotic convex geometries", it was proved that the existence of nicely bounded sections of two symmetric convex bodies K and L implies that the intersection of randomly rotated…

Functional Analysis · Mathematics 2016-12-23 Mark Rudelson , Roman Vershynin

Generalizing the slicing inequality for functions on convex bodies from [11], it was proved in [4] that there exists an absolute constant $c$ so that for any $n\in \mathbb N$, any $q\in [0,n-1)$ which is not an odd integer, any…

Functional Analysis · Mathematics 2023-12-29 Julián Haddad , Alexander Koldobsky

A question related to some conjectures of Lutwak about the affine quermassintegrals of a convex body $K$ in ${\mathbb R}^n$ asks whether for every convex body $K$ in ${\mathbb R}^n$ and all $1\leqslant k\leqslant n$ $$\Phi_{[k]}(K):={\rm…

Metric Geometry · Mathematics 2019-06-20 Giorgos Chasapis , Nikos Skarmogiannis

It was shown in \cite{GL} that the maximal surface area of a convex set in $\mathbb{R}^n$ with respect to a rotation invariant log-concave probability measure $\gamma$ is of order $\frac{\sqrt{n}}{\sqrt[4]{Var|X|} \sqrt{\mathbb{E}|X|}}$,…

Classical Analysis and ODEs · Mathematics 2014-09-17 Galyna V. Livshyts

We consider the problem of computing the minimum value $f_{\min,K}$ of a polynomial $f$ over a compact set $K \subseteq \mathbb{R}^n$, which can be reformulated as finding a probability measure $\nu$ on $K$ minimizing $\int_K f d\nu$.…

Optimization and Control · Mathematics 2020-01-31 Lucas Slot , Monique Laurent

We prove the following sparse approximation result for polytopes. Assume that $Q$ is a polytope in John's position. Then there exist at most $2d$ vertices of $Q$ whose convex hull $Q'$ satisfies $Q \subseteq - 2d^2 \, Q'$. As a consequence,…

Metric Geometry · Mathematics 2022-09-13 Víctor Hugo Almendra-Hernández , Gergely Ambrus , Matthew Kendall

For a convex body $K \subset {\mathbb R}^n$, let $K^z = \{y\in{\mathbb R}^n : \langle y-z, x-z\rangle\le 1, \mbox{\ for all\ } x\in K\}$ be the polar body of $K$ with respect to the center of polarity $z \in {\mathbb R}^n$. The goal of this…

Metric Geometry · Mathematics 2017-08-29 Matthew Alexander , Matthieu Fradelizi , Artem Zvavitch

Pick $n$ independent and uniform random points $U_1,\ldots,U_n$ in a compact convex set $K$ of $\mathbb{R}^d$ with volume 1, and let $P^{(d)}_K(n)$ be the probability that these points are in convex position. The Sylvester conjecture in…

Combinatorics · Mathematics 2024-11-14 Jean-François Marckert , Ludovic Morin

For two convex discs $K$ and $L$, we say that $K$ is $L$-convex if it is equal to the intersection of all translates of $L$ that contain $K$. In $L$-convexity the set $L$ plays a similar role as closed half-spaces do in the classical notion…

Metric Geometry · Mathematics 2026-04-09 Ferenc Fodor , Dániel I. Papvári , Viktor Vígh

Suppose that $K \subseteq \RR^d$ is a 0-symmetric convex body which defines the usual norm $$ \Norm{x}_K = \sup\Set{t\ge 0: x \notin tK} $$ on $\RR^d$. Let also $A\subseteq\RR^d$ be a measurable set of positive upper density $\rho$. We show…

Classical Analysis and ODEs · Mathematics 2007-05-23 Mihail N. Kolountzakis

We study the problem of approximating the mixed volume $V(P_1^{(\alpha_1)}, \dots, P_k^{(\alpha_k)})$ of an $k$-tuple of convex polytopes $(P_1, \dots, P_k)$, each of which is defined as the convex hull of at most $m_0$ points in…

Computational Geometry · Computer Science 2025-12-30 Hariharan Narayanan , Sourav Roy

We investigate algorithms for reconstructing a convex body $K$ in $\mathbb {R}^n$ from noisy measurements of its support function or its brightness function in $k$ directions $u_1,...,u_k$. The key idea of these algorithms is to construct a…

Statistics Theory · Mathematics 2007-06-13 Richard J. Gardner , Markus Kiderlen , Peyman Milanfar

Let $K$ be an $n$-dimensional convex body. Define the difference body by $$ K-K= \{x-y \mid x,y \in K \}. $$ We estimate the volume of the section of $K-K$ by a linear subspace $F$ via the maximal volume of sections of $K$ parallel to $F$.…

Functional Analysis · Mathematics 2007-05-23 M. Rudelson