English
Related papers

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

200 papers

We extend to arbitrary finite $n$ the notion of immobilization of a convex body $O$ in $R^n$ by a finite set of points $P$ in the boundary of $O$. Because of its importance for this problem, necessary and sufficient conditions are found for…

Metric Geometry · Mathematics 2018-10-29 Anthony David Gilbert , Saul Hannington Nsubuga

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…

Metric Geometry · Mathematics 2013-12-23 David Alonso-Gutiérrez , Bernardo González , Carlos Hugo Jiménez

Let $K$ be a convex body in $\mathbb{R}^n$ with Santal\'o point at 0\. We show that if $K$ has a point on the boundary with positive generalized Gau{\ss} curvature, then the volume product $|K| |K^\circ|$ is not minimal. This means that a…

Functional Analysis · Mathematics 2010-09-21 Shlomo Reisner , Carsten Schütt , Elisabeth M. Werner

We prove the Blaschke-Santal\'o inequality restricted to $n$-gons: the extremal polygons are the affine regular $n$-gons. If either the John or the L\"owner ellipse of a planar $o$-symmetric convex body $K$ is the unit circle about $o$,…

Metric Geometry · Mathematics 2014-11-18 K. J. Böröczky , E. Makai

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 show that there exists a family of Knapsack polytopes such that, for each polytope P from this family and each {\epsilon} > 0, any {\epsilon}-approximated formulation of P in the original space R^n requires a number of inequalities that…

Optimization and Control · Mathematics 2015-03-18 Yuri Faenza , Laura Sanità

Eggleston (1957) proved that in the Euclidean plane the best approximating convex $n$-gon to a convex disc $K$ is always inscribed in $K$ if we measure the distance by perimeter deviation. We prove that the analogue of Eggleston's statement…

Metric Geometry · Mathematics 2026-04-13 Ferenc Fodor

The largest volume ratio of given convex body $K \subset \mathbb{R}^n$ is defined as $$\mbox{lvr}(K):= \sup_{L \subset \mathbb{R}^n} \mbox{vr}(K,L),$$ where the $\sup$ runs over all the convex bodies $L$. We prove the following sharp lower…

Metric Geometry · Mathematics 2020-04-21 Daniel Galicer , Mariano Merzbacher , Damián Pinasco

In this work we discuss a conjecture of Viterbo relating the symplectic capacity of a convex body and its volume. The conjecture states that among all 2n-dimensional convex bodies with a given volume the euclidean ball has maximal…

Symplectic Geometry · Mathematics 2007-05-23 Shiri Artstein-Avidan , Yaron Ostrover

In this note we examine the volume of the convex hull of two congruent copies of a convex body in Euclidean $n$-space, under some subsets of the isometry group of the space. We prove inequalities for this volume if the two bodies are…

Metric Geometry · Mathematics 2013-06-19 Ákos G. Horváth , Z. Lángi

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

For a convex body $K\subset\R^n$ and $i\in\{1,...,n-1\}$, the function assigning to any $i$-dimensional subspace $L$ of $\R^n$, the $i$-dimensional volume of the orthogonal projection of $K$ to $L$, is called the $i$-th projection function…

Metric Geometry · Mathematics 2007-05-23 Ralph Howard , Daniel Hug

A polyhedral approximation of a convex body can be calculated by solving approximately an associated multiobjective convex program (MOCP). An MOCP can be solved approximately by Benson type algorithms, which compute outer and inner…

Optimization and Control · Mathematics 2024-01-26 Andreas Löhne , Fangyuan Zhao , Lizhen Shao

Let $K$ be a convex body in $\mathbb{R} ^d$, with $d = 2,3$. We determine sharp sufficient conditions for a set $E$ composed of $1$, $2$, or $3$ points of ${\rm bd}K$, to contain at least one endpoint of a diameter of $K$ (for $d=2,3$). We…

Metric Geometry · Mathematics 2019-10-28 Jin-ichi Itoh , Costin Vîlcu , Liping Yuan , Tudor Zamfirescu

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

Let $K$ be a $d$ dimensional convex body with a twice continuously differentiable boundary and everywhere positive Gauss-Kronecker curvature. Denote by $K_n$ the convex hull of $n$ points chosen randomly and independently from $K$ according…

Metric Geometry · Mathematics 2015-02-25 Imre Bárány , Ferenc Fodor , Viktor Vígh

Assume $K$ is a convex body in $R^d$, and $X$ is a (large) finite subset of $K$. How many convex polytopes are there whose vertices come from $X$? What is the typical shape of such a polytope? How well the largest such polytope (which is…

Combinatorics · Mathematics 2007-05-23 Imre Bárány

A random spherical polytope $P_n$ in a spherically convex set $K \subset S^d$ as considered here is the spherical convex hull of $n$ independent, uniformly distributed random points in $K$. The behaviour of $P_n$ for a spherically convex…

Probability · Mathematics 2015-05-19 Imre Bárány , Daniel Hug , Matthias Reitzner , Rolf Schneider

In (the surface of) a convex polytope P^n in R^n+1, for small prescribed volume, geodesic balls about some vertex minimize perimeter. This revision corrects a mistake in the mass bound argument in the proof of Theorem 3.8.

Metric Geometry · Mathematics 2007-05-23 Frank Morgan

The Vapnik-Chervonenkis dimension of a set K in R^n is the maximal dimension of the coordinate cube of a given size, which can be found in coordinate projections of K. We show that the VC dimension of a convex body governs its entropy. This…

Functional Analysis · Mathematics 2016-12-23 S. Mendelson , R. Vershynin
‹ Prev 1 3 4 5 6 7 10 Next ›