English
Related papers

Related papers: John's Position is not good for approximation

200 papers

Let $H_n$ be the minimal number such that any $n$-dimensional convex body can be covered by $H_n$ translates of interior of that body. Similarly $H_n^s$ is the corresponding quantity for symmetric bodies. It is possible to define $H_n$ and…

Metric Geometry · Mathematics 2024-04-02 Andrii Arman , Andriy Bondarenko , Andriy Prymak

A planar point set is in convex position precisely when it has a convex polygonization, that is, a polygonization with maximum interior angle measure at most \pi. We can thus talk about the convexity of a set of points in terms of the…

Computational Geometry · Computer Science 2014-09-16 Danny Rorabaugh

Let $K \subset \R^d$ be a smooth convex set and let $\P_\la$ be a Poisson point process on $\R^d$ of intensity $\la$. The convex hull of $\P_\la \cap K$ is a random convex polytope $K_\la$. As $\la \to \infty$, we show that the variance of…

Probability · Mathematics 2012-06-22 Pierre Calka , J. E. Yukich

We prove that for any norm |*| in the d-dimensional real vector space V and for any odd n>0 there is a non-negative polynomial p(x), x in V of degree 2n such that p^{1/2n}(x) < |x| < c(n,d) p^{1/2n}(x), where c(n,d)={n+d-1 choose n}^{1/2n}.…

Functional Analysis · Mathematics 2007-05-23 Alexander Barvinok

Let $K$ and $L$ be two convex bodies in $\mathbb R^n$, $n\geq 2$, with $L\subset \text{int}\, K$. We say that $L$ is an equichordal body for $K$ if every chord of $K$ tangent to $L$ has length equal to a given fixed value $\lambda$. J.…

Metric Geometry · Mathematics 2026-02-03 Jesús Jerónimo-Castro , Francisco G. Jimenez-Lopez , Efrén Morales-Amaya

For an isotropic convex body $K\subset\mathbb{R}^n$ we consider the isotropic constant $L_{K_N}$ of the symmetric random polytope $K_N$ generated by $N$ independent random points which are distributed according to the cone probability…

Metric Geometry · Mathematics 2018-07-09 Joscha Prochno , Christoph Thäle , Nicola Turchi

We consider a stationary Poisson hyperplane process with given directional distribution and intensity in $d$-dimensional Euclidean space. Generalizing the zero cell of such a process, we fix a convex body $K$ and consider the intersection…

Probability · Mathematics 2013-12-17 Daniel Hug , Rolf Schneider

It is proved that if $C$ is a convex body in ${\Bbb R}^n$ then $C$ has an affine image $\widetilde C$ (of non-zero volume) so that if $P$ is any 1-codimensional orthogonal projection, $$|P\widetilde C| \ge |\widetilde C|^{n-1\over n}.$$ It…

Metric Geometry · Mathematics 2016-09-06 Keith Ball

We show that a realization of a closed connected PL-manifold of dimension n-1 in n-dimensional Euclidean space (n>2) is the boundary of a convex polyhedron (finite or infinite) if and only if the interior of each (n-3)-face has a point,…

Computational Geometry · Computer Science 2007-05-23 Konstantin Rybnikov

Let $K \subset {\mathbb R}^2$ be an $o$-symmetric convex body, and $K^*$ its polar body. Then we have $|K|\cdot |K^*| \ge 8$, with equality if and only if $K$ is a parallelogram. ($| \cdot |$ denotes volume). If $K \subset {\mathbb R}^2$ is…

Metric Geometry · Mathematics 2015-07-07 K. J. Böröczky , E. Makai , M. Meyer , S. Reisner

We prove an exponential deviation inequality for the convex hull of a finite sample of i.i.d. random points with a density supported on an arbitrary convex body in $\R^d$, $d\geq 2$. When the density is uniform, our result yields rate…

Probability · Mathematics 2017-04-07 Victor-Emmanuel Brunel

The subspace approximation problem Subspace($k$,$p$) asks for a $k$-dimensional linear subspace that fits a given set of points optimally, where the error for fitting is a generalization of the least squares fit and uses the $\ell_{p}$ norm…

Data Structures and Algorithms · Computer Science 2011-01-04 Amit Deshpande , Kasturi Varadarajan , Madhur Tulsiani , Nisheeth K. Vishnoi

In 1921 Blichfeldt gave an upper bound on the number of integral points contained in a convex body in terms of the volume of the body. More precisely, he showed that $#(K\cap\Z^n)\leq n! \vol(K)+n$, whenever $K\subset\R^n$ is a convex body…

Metric Geometry · Mathematics 2007-05-23 Martin Henk , Joerg M. Wills

Let $P$ be a (non necessarily convex) embedded polyhedron in $\R^3$, with its vertices on an ellipsoid. Suppose that the interior of $P$ can be decomposed into convex polytopes without adding any vertex. Then $P$ is infinitesimally rigid.…

Differential Geometry · Mathematics 2007-05-23 Jean-Marc Schlenker

In connection with an unsolved problem of Bang (1951) we give a lower bound for the sum of the base volumes of cylinders covering a d-dimensional convex body in terms of the relevant basic measures of the given convex body. As an…

Metric Geometry · Mathematics 2011-09-29 Karoly Bezdek , Alexander Litvak

We consider four problems. Rogers proved that for any convex body $K$, we can cover ${\mathbb R}^d$ by translates of $K$ of density very roughly $d\ln d$. First, we extend this result by showing that, if we are given a family of positive…

Metric Geometry · Mathematics 2017-03-09 Nóra Frankl , János Nagy , Márton Naszódi

In this paper, we apply a capillary John ellipsoid theorem for capillary convex bodies in the Euclidean half-space $\overline{\mathbb{R}^{n+1}_{+}}$. This theorem yields a non-collapsing estimate for capillary hypersurfaces, which provides…

Analysis of PDEs · Mathematics 2026-04-07 Jinrong Hu , Bo Yang

For convex partitions of a convex body $B$ we prove that we can put a homothetic copy of $B$ into each set of the partition so that the sum of homothety coefficients is $\ge 1$. In the plane the partition may be arbitrary, while in higher…

Combinatorics · Mathematics 2012-12-27 Arseniy Akopyan , Roman Karasev

We consider Newton's problem of minimal resistance, in particular we address the problem arising in the limit if the height goes to infinity. We establish existence of solutions and lack radial symmetry of solutions. Moreover, we show that…

Optimization and Control · Mathematics 2021-05-12 Lev Lokutsievskiy , Gerd Wachsmuth , Mikhail Zelikin

Given $n$ points in a $d$ dimensional Euclidean space, the Minimum Enclosing Ball (MEB) problem is to find the ball with the smallest radius which contains all $n$ points. We give a $O(nd\Qcal/\sqrt{\epsilon})$ approximation algorithm for…

Computational Geometry · Computer Science 2010-09-16 Ankan Saha , S. V. N. Vishwanathan , Xinhua Zhang