Answers are grounded in this paper and cite their sources.
We construct an explicit family of real m× n restricted isometries with m→∞, m/n→ 0, δₖ→ 0, and k=m2/3-o(1). We combine Gershgorin's circle theorem with a flat RIP estimate to reduce the problem to choosing a large vertex set in a strongly regular graph with the property that every small subset spans few edges. We select this vertex set using an incidence geometric result due to Zahl. The proof only uses the entrywise absolute value of the Gram matrix despite the conventional wisdom that such proof techniques exhibit a barrier of m1/2. We prove that this barrier is actually m2/3, and we show that our particular construction exhibits the same barrier.
No takes yet. Share an insight, caveat, or question.
Kümmerle et al. (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: