Papers
Topics
Authors
Recent
Search
2000 character limit reached

Upper bound for the Dvoretzky dimension in Milman-Schechtman theorem

Published 12 Dec 2016 in math.FA | (1612.03572v1)

Abstract: For a symmetric convex body $K\subset\mathbb{R}n$, the Dvoretzky dimension $k(K)$ is the largest dimension for which a random central section of $K$ is almost spherical. A Dvoretzky-type theorem proved by V.~D.~Milman in 1971 provides a lower bound for $k(K)$ in terms of the average $M(K)$ and the maximum $b(K)$ of the norm generated by $K$ over the Euclidean unit sphere. Later, V.~D.~Milman and G. Schechtman obtained a matching upper bound for $k(K)$ in the case when $\frac{M(K)}{b(K)}>c(\frac{\log(n)}{n}){\frac{1}{2}}$. In this paper, we will give an elementary proof of the upper bound in Milman-Schechtman theorem which does not require any restriction on $M(K)$ and $b(K)$.

Summary

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.