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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.