基于扩展码的\ell_1^N的几乎欧氏子空间
Almost Euclidean subspaces of \ell_1^N via expander codes
摘要:
我们给出维数为(1-o(1))N的R^N的子空间X的显式(特别是确定性多项式时间)构造,使得对于X中的每个元素x,|x| _1和N^{1/2} |x| _2等价到因子(log N)^{log log N}.如果允许使用N^{o(1)}个随机位,则该因子可以改进为poly(log N)。我们的构造利用不平衡二部图对子空间中的向量施加局部线性约束,并且我们的分析依赖于图的扩展特性。这是受到类似的纠错码构造的启发。
英文摘要:
We give an explicit (in particular, deterministic polynomial time) construction of subspaces X of R^N of dimension (1-o(1))N such that for every element x in X, |x|_1 and N^{1/2} |x|_2 are equivalent up to a factor of (log N)^{log log log N}. If we are allowed to use N^{o(1)} random bits, this factor can be improved to poly(log N). Our construction makes use of unbalanced bipartite graphs to impose local linear constraints on vectors in the subspace, and our analysis relies on expansion properties of the graph. This is inspired by similar constructions of error-correcting codes.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。