arXiv · math/0701102
Almost Euclidean sections of the N-dimensional cross-polytope using O(N) random bits
Abstract
It is well known that R^N 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.
Explore related subjects
Keep this discovery
Shachar Lovett, Sasha Sodin. 2008-10-20. Almost Euclidean sections of the N-dimensional cross-polytope using O(N) random bits. https://doi.org/10.1142/s0219199708002879
Cite the original work for its findings. Save a collection to share your selection of sources.