Papers
Topics
Authors
Recent
Search
2000 character limit reached

Almost Euclidean sections of the N-dimensional cross-polytope using O(N) random bits

Published 3 Jan 2007 in math.FA, cs.CC, and math.MG | (0701102v3)

Abstract: It is well known that RN has subspaces of dimension proportional to N on which the \ell_1 norm is equivalent to the \ell_2 norm; however, no explicit constructions are known. Extending earlier work by Artstein--Avidan and Milman, we prove that such a subspace can be generated using O(N) random bits.

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.

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.

Collections

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