We show that for every convex body K in \({\mathbb{R}}^{n}\), there is a convex body H such that
$$H \subset K \subset c \cdot H\qquad \qquad \text{ with}\ c = 2.24$$
and H has at most O(n) contact points with the minimal volume ellipsoid that contains it. When K is symmetric, we can obtain the same conclusion for every constant c > 1. We build on work of Rudelson [Israel J. Math. 101(1), 92–124 (1997)], who showed the existence of H with \(O(n\log n)\) contact points. The approximating body H is constructed using the “barrier” method of Batson, Spielman, and the author, which allows one to extract a small set of vectors with desirable spectral properties from any John’s decomposition of the identity. The main technical contribution of this paper is a way of controlling the mean of the vectors produced by that method, which is necessary in the application to John’s decompositions of nonsymmetric bodies.
[1]
G. B. Guccia.
Rendiconti del circolo matematico di Palermo
,
1906
.
[2]
P. Gruber.
Minimal ellipsoids and their duals
,
1988
.
[3]
M. Rudelson.
Random Vectors in the Isotropic Position
,
1996,
math/9608208.
[4]
M. Rudelson.
Contact points of convex bodies
,
1997
.
[5]
K. Ball.
An elementary introduction to modern convex geometry, in flavors of geometry
,
1997
.
[6]
K. Ball.
An Elementary Introduction to Modern Convex Geometry
,
1997
.
[7]
Apostolos Giannopoulos,et al.
Extremal problems and isotropic positions of convex bodies
,
2000
.
[8]
Nikhil Srivastava,et al.
Twice-ramanujan sparsifiers
,
2008,
STOC '09.