Almost Euclidean sections of the N-dimensional cross-polytope using O(N) random bits
classification
🧮 math.FA
cs.CCmath.MG
keywords
bitsknownnormrandomalmostartstein--avidanconstructionscross-polytope
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.