Abstract. We give a new explicit construction of n × N matrices satisfying the Restricted Isometry Property (RIP). Namely, for some ε > 0, large N and any n satisfying N 1−ε ≤ n ≤ N , we construct RIP matrices of order k ≥ n 1/2+ε and constant δ = n −ε . This overcomes the natural barrier k = O(n 1/2 ) for proofs based on small coherence, which are used in all previous explicit constructions of RIP matrices. Key ingredients in our proof are new estimates for sumsets in product sets and for exponential sums with the products of sets possessing special additive structure. We also give a construction of sets of n complex numbers whose k-th moments are uniformly small for 1 ≤ k ≤ N (Turán's power sum problem), which improves upon known explicit constructions when (log N ) 1+o(1) ≤ n ≤ (log N ) 4+o(1) . This latter construction produces elementary explicit examples of n × N matrices that satisfy RIP and whose columns constitute a new spherical code; for those problems the parameters closely match those of existing constructions in the range (log N ) 1+o(1) ≤ n ≤ (log N ) 5/2+o(1) .
Using new estimates for sumsets in product sets and for exponential sums with the products of sets possessing special additive structure, Bourgain, Dilworth, Ford, Konyagin and Kutzarva REF were able to overcome the
Explicit constructions of RIP matrices and related problems
Duke Math. J. 159, no. 1 (2011), 145-185
Mathematics Computer Science