Duke Mathematical Journal

Explicit constructions of RIP matrices and related problems

Jean Bourgain, Stephen Dilworth, Kevin Ford, Sergei Konyagin, and Denka Kutzarova

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text

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 N1ϵnN, we construct RIP matrices of order kn1/2+ϵ and constant δ=nϵ. This overcomes the natural barrier k=O(n1/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 kth moments are uniformly small for 1kN (Turán's power sum problem), which improves upon known explicit constructions when (logN)1+o(1)n(logN)4+o(1). This latter construction produces elementary explicit examples of n×N matrices that satisfy the RIP and whose columns constitute a new spherical code; for those problems the parameters closely match those of existing constructions in the range (logN)1+o(1)n(logN)5/2+o(1).

Article information

Source
Duke Math. J., Volume 159, Number 1 (2011), 145-185.

Dates
First available in Project Euclid: 11 July 2011

Permanent link to this document
https://projecteuclid.org/euclid.dmj/1310416365

Digital Object Identifier
doi:10.1215/00127094-1384809

Mathematical Reviews number (MathSciNet)
MR2817651

Zentralblatt MATH identifier
1236.94027

Subjects
Primary: 11T23: Exponential sums
Secondary: 11B13: Additive bases, including sumsets [See also 05B10] 11B30: Arithmetic combinatorics; higher degree uniformity 41A46: Approximation by arbitrary nonlinear expressions; widths and entropy 94A12: Signal theory (characterization, reconstruction, filtering, etc.) 94B60: Other types of codes

Citation

Bourgain, Jean; Dilworth, Stephen; Ford, Kevin; Konyagin, Sergei; Kutzarova, Denka. Explicit constructions of RIP matrices and related problems. Duke Math. J. 159 (2011), no. 1, 145--185. doi:10.1215/00127094-1384809. https://projecteuclid.org/euclid.dmj/1310416365


Export citation

References

  • M. Ajtai, H. Iwaniec, J. Komlós, J. Pintz, and E. Szemerédi, Construction of a thin set with small Fourier coefficients, Bull. Lond. Math. Soc. 22 (1990), 583–590.
  • N. Alon, O. Goldreich, J. Håstad, and R. Peralta, Simple constructions of almost $k$-wise independent random variables, Random Structures Algorithms 3 (1992), 289–304.
  • J. Andersson, Explicit solutions to certain inf max problems from Turán power sum theory, Indag. Math. (N.S.) 18 (2007), 189–194.
  • —, “On the solutions to a power sum problem” in Analytic and Probabilistic Methods in Number Theory, TEV, Vilnius, 2007.
  • —, On some power sum problems of Montgomery and Turán, Int. Math. Res. Not. IMRN (2008), no. 8, art. ID rnn015.
  • R. Baraniuk, M. Davenport, R. Devore, and M. Wakin, A simple proof of the restricted isometry property for random matrices, Constr. Approx. 28 (2008), 253–263.
  • A. Ben-Aroya and A. Ta-Shma, “Constructing small-bias sets from algebraicgeometric codes” in 2009 50th Annual IEEE Symposium on Foundations of Computer Science (Atlanta, 2009), IEEE Computer Soc., Los Alamitos, Calif., 2009, 191–197.
  • R. Berinde, A. Gilbert, P. Indyk, H. Karloff, and M. Strauss, Combining geometry and combinatorics: A unified approach to sparse signal recovery, preprint, 2008.
  • B. Bollobás and I. Leader, Sums in the grid, Discrete Math. 162 (1996), 31–48.
  • J. Bourgain, Multilinear exponential sums in prime fields under optimal entropy condition on the sources, Geom. Funct. Anal. 18 (2009), 1477–1502.
  • J. Bourgain and M. Z. Garaev, On a variant of sum-product estimates and explicit exponential sum bounds in prime fields, Math. Proc. Cambridge Philos. Soc. 146 (2009), 1–21.
  • J. Bourgain and A. A. Glibichuk, Multilinear exponential sum estimate in an arbitrary finite field, preprint, to appear in J. Anal. Math.
  • E. J. Candès, The restricted isometry property and its implications for compressed sensing, C. R. Math. Acad. Sci. Paris 346 (2008), 589–592.
  • E. J. Candès, J. K. Romberg, and T. Tao, Stable signal recovery from incomplete and inaccurate measurements, Comm. Pure Appl. Math. 59 (2006), 1207–1223.
  • E. J. Candès and T. Tao, Decoding by linear programming, IEEE Trans. Inform. Theory 51 (2005), 4203–4215.
  • —, Near-optimal signal recovery from random projections: Universal encoding strategies? IEEE Trans. Inform. Theory 52 (2006), 5406,–5425.
  • R. A. Devore, Deterministic constructions of compressed sensing matrices, J. Complexity 23 (2007), 918–925.
  • D. L. Donoho, M. Elad, and V. N. Temlyakov, On the Lebesgue-type inequalities for greedy approximation, J. Approx. Theory 147 (2007), 185–195.
  • P. Erdös and A. Rényi, A probabilistic approach to problems of Diophantine approximation, Illinois J. Math. 1 (1957), 303–315.
  • A. C. Gilbert, S. Muthukrishnan, and M. J. Strauss, “Approximation of functions over redundant dictionaries using coherence” in The 14th Annual ACM-SIAM Symposium on Discrete Algorithms (Baltimore, 2003), ACM, New York, 2003, 243,–252.
  • E. D. Gluskin, An octahedron is poorly approximated by random subspaces (in Russian), Funktsional. Anal. i Prilozhen. 20, no. 1 (1986), 14–20, 96; English translation in Funct. Anal. Appl. 20, no. 1 (1986), 11–16.
  • S. Gurevich and R. Hadani, The statistical restricted isometry property and the Wigner semicircle distribution of incoherent dictionaries, preprint.
  • V. Guruswami and M. Sudan, “List decoding algorithms for certain concatenated codes” in Thirty-Second Annual ACM Symposium on Theory of Computing (Portland, 2000), ACM, New York, 2000. 181–190.
  • K. F. Ireland and M. I. Rossen, A Classical Introduction to Modern Number Theory, Grad. Texts in Math. 84, Springer, New York, 1982.
  • W. B. Johnson and J. Lindenstrauss, “Extensions of Lipschitz mappings into a Hilbert space” in Conference in Modern Analysis and Probability (New Haven, 1982), Contemp. Math. 26, Amer. Math. Soc., Providence, 1984, 189–206.
  • B. S. Kashin, The diameters of octahedra, Uspekhi Mat. Nauk 30 (1975), 251–252.
  • —, Diameters of some finite-dimensional sets and classes of smooth functions (in Russian), Izv. Ross. Akad. Nauk Ser. Mat. 41 (1977), 334–351; English translation in Math. USSR Izv. 11 (1977), 317–333.
  • N. M. Katz, An estimate for character sums, J. Amer. Math. Soc. 2 (1989), 197–200.
  • V. I. Levenshteĭ N, Bounds for packings of metric spaces and some of their applications (in Russian), Problemy Tekhn. Kibernet. Robot. 40 (1983), 43–110.
  • E. Liu and V. N. Temlyakov, Orthogonal super greedy algorithm and applications in compressed sensing, preprint, 2010.
  • E. Livshitz, On efficiency of orthogonal matching pursuit, preprint.
  • S. Mendelson, A. Pajor, and N. Tomczak-Jaegermann, Reconstruction and subgaussian operators in asymptotic geometric analysis, Geom. Funct. Anal. 17 (2007), 1248–1282.
  • H. L. Montgomery, Ten Lectures on the Interface Between Analytic Number Theory and Harmonic Analysis, CBMS Reg. Conf. Sec. Math. 84, Amer. Math. Soc., Providence, 1994.
  • D. Needle and R. Vershynin, Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit, Found. Comput. Math. 9 (2009), 317–334.
  • J. Nelson and V. N. Temlyakov, On the size of incoherent systems, preprint, to appear in J. Approx. Theory.
  • G. I. Perel'Muter and I. E. Shparlinskiĭ, Distribution of primitive roots in finite fields (in Russian), Uspekhi Mat. Nauk 45, no. 1 (1990), 185–186; English translation in Russian Math. Surveys 45, no. 1 (1990), 223–224.
  • A. Prékopa, Logarithmic concave measures with application to stochastic programming, Acta Sci. Math. (Szeged) 32 (1971), 301–316.
  • A. Razborov, E. Szemerédi, and A. Wigderson, Constructing small sets that are uniform in arithmetic progressions, Combin. Probab. Comput. 2 (1993), 513–518.
  • J. B. Rosser and L. Schoenfeld, Approximate formulas for some functions of prime numbers, Illinois J. Math. 6 (1962), 64–94.
  • M. Rudelson and R. Vershynin, On sparse reconstruction from Fourier and Gaussian measurements, Comm. Pure Appl. Math. 61 (2008), 1025–1045.
  • S. B. Stechkin, Some extremal properties of trigonometric sums (in Russian), Mat. Zametki 55, no. 2 (1994), 130–143; English translation in Math. Notes 55 nos. 1–2 (1994), 195–203.
  • —, The Turán problem for trigonometric sums (in Russian), Tr. Mat. Inst. Steklova 219 (1997), 335–339; English translation in Proc. Steklov Inst. Math. 219, no. 4 (1997), 329–333.
  • T. Tao, Open question: deterministic uup matrices, preprint, http://www.terrytao.wordpress.com/2007/07/02/open-question-deterministic-uup-matrices (accessed 5 May 2011).
  • T. Tao and V. Vu, Additive Combinatorics, Cambridge Stud. Adv. Math. 105, Cambridge Univ. Press, Cambridge, 2006.
  • P. Turán, On a New Method of Analysis and its Applications, Pure Appl. Math. (New York), John Wiley, New York, 1984.
  • I. M. Vinogradov, An Introduction to the Theory of Numbers, Pergamon Press, London and New York, 1955.
  • D. R. Woodall, A theorem on cubes, Mathematika 24 (1977), 60–62.