Papers
Topics
Authors
Recent
Search
2000 character limit reached

A polynomial bound in Dvoretzky's theorem

Published 2 Oct 2026 in math.FA, math.MG, and math.PR | (2610.03204v1)

Abstract: We present a simple proof of the ε\varepsilon-Dvoretzky conjecture, which asserts that the dependence on the approximation parameter ε\varepsilon in Dvoretzky's theorem is polynomial in 1/ε1/\varepsilon. In particular, if n≥(C/ε)<sup>ℓ/2+1n \geq (C/\varepsilon)<sup>{\ell/2+1}, then any nn-dimensional convex body has, through any given interior point, an ℓ\ell-dimensional section that is ε\varepsilon-close to a Euclidean ball. Here, $C &gt; 0$ is a universal constant. We in fact obtain a sharper dependence on ε\varepsilon. The proof is probabilistic, but uses a different probabilistic model from those employed previously. We also prove a simultaneous version of our theorem for a finite family of convex bodies with the origin in their interior, yielding a common linear subspace on which all of the bodies have nearly-Euclidean sections. Finally, we compare the radius of the approximating Euclidean ball with familiar geometric parameters, such as the mean widths of the body and its dual.

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

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

Continue Learning

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

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.