arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1805.11238math.PRcs.ITmath.ITstat.CO
收藏

RIP矩阵的显式构造是Ramsey-hard的

Explicit construction of RIP matrices is Ramsey-hard

David Gamarnik

摘要:

矩阵$Φ\in\R^{n\times p}$满足约束等距性(RIP)是压缩感知方法的重要组成部分。虽然已知随机矩阵即使对于$n=\log^{O(1)}p$也以高概率满足RIP,但是这种矩阵的显式构造无视重复的努力,并且最已知的方法遇到了所谓的$\sqrt{n}$稀疏性瓶颈。值得注意的例外是Bourgain等人的工作\cite{bourgain2011explicit}构建了一个具有稀疏性$s=Θ(n^{{1\over 2}+ε})$的$n\times p$ RIP矩阵,但在$n=Ω(p^{1-δ})$体系中。在这个简短的说明中,我们解决了这个开放的问题在某种意义上表明,一个矩阵满足RIP的制度$n=O(\log^2 p)$和$s=Θ(n^{1\over 2})$明确的建设意味着一个明确的建设三色拉姆齐图的$p$节点与集团大小由$O(\log^2 p)$ -一个问题,在极值组合已经开放了几十年。

英文摘要:

Matrices $Φ\in\R^{n\times p}$ satisfying the Restricted Isometry Property (RIP) are an important ingredient of the compressive sensing methods. While it is known that random matrices satisfy the RIP with high probability even for $n=\log^{O(1)}p$, the explicit construction of such matrices defied the repeated efforts, and the most known approaches hit the so-called $\sqrt{n}$ sparsity bottleneck. The notable exception is the work by Bourgain et al \cite{bourgain2011explicit} constructing an $n\times p$ RIP matrix with sparsity $s=Θ(n^{{1\over 2}+ε})$, but in the regime $n=Ω(p^{1-δ})$. In this short note we resolve this open question in a sense by showing that an explicit construction of a matrix satisfying the RIP in the regime $n=O(\log^2 p)$ and $s=Θ(n^{1\over 2})$ implies an explicit construction of a three-colored Ramsey graph on $p$ nodes with clique sizes bounded by $O(\log^2 p)$ -- a question in the extremal combinatorics which has been open for decades.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑