Explicit restricted isometries with $k=m^{2/3-o(1)}$
Auteurs : Christian Kümmerle, Dustin G. Mixon
Résumé scientifique
We construct an explicit family of real $m\times n$ restricted isometries with $m\to\infty$, $m/n\to 0$, $δ_k\to 0$, and $k=m^{2/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 $m^{1/2}$. We prove that this barrier is actually $m^{2/3}$, and we show that our particular construction exhibits the same barrier.
Les articles autour de lui, par date et par proximité
Plus haut, c’est plus proche de cet article ; à gauche, c’est plus ancien. Les traits relient les articles proches entre eux : les groupes de traits sont des sous-thèmes. Sélectionnez un point pour voir pourquoi il est là. Retour au résumé de cet article
Les articles autour de celui-ci
Classés selon la proximité de leur titre et de leur résumé avec ceux de cet article. Sélectionnez-en pour les lire ensemble.
Les articles les plus proches
-
Explicit constructions of RIP matrices and related problemsJ. Bourgain, S. Dilworth, Kevin Ford et al. · 2010 · arXiv.org · preprint, non relu par les pairs · cité 257 fois · Pas encore résumé
Explicit constructions of RIP matrices and related problems dépasse la borne liée à la cohérence avec des matrices explicites, tandis que cet article pousse le contrôle jusqu’à l’exposant 2/3.
Résumé scientifique
We give a new explicit construction ofn×N matrices satisfying the Restricted Isometry Property (RIP). Namely, for some e > 0, largeN , and anyn satisfyingN1−e ≤ n ≤ N , we construct RIP matrices of order k ≥ n1/2+e and constant δ = n−e. 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 1 ≤ k ≤ N (Turan’s power sum problem), which…
-
Explicit RIP matrices: an updateKevin Ford, D. Kutzarova, G. Shakan · 2021 · Acta Mathematica Hungarica · cité 2 fois · Pas encore résumé
Explicit RIP matrices: an update améliore les paramètres de constructions explicites par combinatoire additive, sujet que cet article prolonge en visant un exposant supérieur.
Résumé scientifique
Leveraging recent advances in additive combinatorics, we exhibit explicit matrices satisfying the Restricted Isometry Property with better parameters. Namely, for ε=3.26·10-7\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varepsilon=3.26\cdot 10^{-7}$$\end{document}, large k\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$k$$\end{docu…
-
Explicit Matrices with the Restricted Isometry Property: Breaking the Square-Root BottleneckD. Mixon · 2014 · arXiv.org · preprint, non relu par les pairs · cité 29 fois · Pas encore résumé
Explicit Matrices with the Restricted Isometry Property: Breaking the Square-Root Bottleneck examine une construction dépassant le seuil racine carrée, que cet article étend à l’exposant 2/3.
Résumé scientifique
Matrices with the restricted isometry property (RIP) are of particular interest in compressed sensing. To date, the best known RIP matrices are constructed using random processes, while explicit constructions are notorious for performing at the “square-root bottleneck,” i.e., they only accept sparsity levels on the order of the square root of the number of measurements. The only known explicit matrix which surpasses this bottleneck was constructed by Bourgain, Dilworth, Ford, Konyagin, and Kutzarova in Bourgain et al. (Duke Math. J. 159:145–185, 2011). This chapter provides three contributions to advance the groundbreaking work of Bourgain et al.: (i) we develop an intuition for their matrix…
-
A conditional construction of restricted isometriesA. Bandeira, D. Mixon, Joel Moreira · 2014 · arXiv.org · preprint, non relu par les pairs · cité 27 fois · Pas encore résumé
A conditional construction of restricted isometries utilise une transformée de Fourier discrète restreinte aux résidus quadratiques, au lieu des graphes fortement réguliers de cet article.
Résumé scientifique
We study the restricted isometry property of a matrix that is built from the discrete Fourier transform matrix by collecting rows indexed by quadratic residues. We find an $\epsilon>0$ such that, conditioned on a folklore conjecture in number theory, this matrix satisfies the restricted isometry property with sparsity parameter $K=\Omega(M^{1/2+\epsilon})$, where $M$ is the number of rows.
-
Derandomizing restricted isometries via the Legendre symbolAfonso S. Bandeira, Matthew Fickus, Dustin G. Mixon et al. · 2014 · Combinatorics · cité 16 fois · Résumé IA disponible
Derandomizing restricted isometries via the Legendre symbol réduit les bits aléatoires d’une matrice de Bernoulli, tandis que cet article construit des matrices explicites.
Résumé scientifique
The restricted isometry property (RIP) is an important matrix condition in compressed sensing, but the best matrix constructions to date use randomness. This paper leverages pseudorandom properties of the Legendre symbol to reduce the number of random bits in an RIP matrix with Bernoulli entries. In this regard, the Legendre symbol is not special---our main result naturally generalizes to any small-bias sample space. We also conjecture that no random bits are necessary for our Legendre symbol--based construction.
-
The Road to Deterministic Matrices with the Restricted Isometry PropertyA. Bandeira, M. Fickus, D. Mixon et al. · 2012 · Journal of Fourier Analysis and Applications · cité 141 fois · Pas encore résumé
The Road to Deterministic Matrices with the Restricted Isometry Property examine plusieurs techniques déterministes pour établir la RIP, dont les constructions explicites étudiées ici.
Résumé scientifique
The restricted isometry property (RIP) is a well-known matrix condition that provides state-of-the-art reconstruction guarantees for compressed sensing. While random matrices are known to satisfy this property with high probability, deterministic constructions have found less success. In this paper, we consider various techniques for demonstrating RIP deterministically, some popular and some novel, and we evaluate their performance. In evaluating some techniques, we apply random matrix theory and inadvertently find a simple alternative proof that certain random matrices are RIP. Later, we propose a particular class of matrices as candidates for being RIP, namely, equiangular tight frames (ET…
-
Breaking the k2 barrier for explicit RIP matricesJ. Bourgain, S. Dilworth, Kevin Ford et al. · 2011 · Symposium on the Theory of Computing · cité 28 fois · Pas encore résumé
Breaking the k2 barrier for explicit RIP matrices traite aussi de constructions RIP explicites et de leurs limites, mais son résumé ne précise pas de méthode.
-
A Simple Proof of the Restricted Isometry Property for Random MatricesRichard Baraniuk, M. Davenport, R. DeVore et al. · 2008 · Constructive Approximation · cité 2 610 fois · Pas encore résumé
A Simple Proof of the Restricted Isometry Property for Random Matrices porte sur la RIP, mais son résumé ne précise ni méthode ni résultat à comparer.
Les travaux antérieurs sur lesquels il s’appuie
-
Sharp Bounds for Guiduli-Type Hereditary Spectral ProblemsDong-Xiu Cai, Ji Zeng, Xiao-Dong Zhang · 2026 · cité 1 fois · Pas encore résumé
Sharp Bounds for Guiduli-Type Hereditary Spectral Problems étudie les rayons spectraux sous contraintes de densité des sous-graphes, notion liée à la réduction utilisée ici.
Résumé scientifique
Guiduli asked in 1996 the following problem concerning the maximum spectral radius of a graph under hereditary density constraints. If an $n$-vertex graph $G$ satisfies $e(H)\le c|V(H)|^2$ for every subgraph $H$ of $G$, must one have $\lambda(G)\le 2cn$? More generally, what remains true when the exponent $2$ is replaced by a constant less than $2$? We study the natural power-law version of this question for all $1<p\le2$. For $1<p\le 2$, define \[ d_p(G)=\max_{\varnothing\ne S\subseteq V(G)}\frac{e(G[S])}{|S|^p}. \] We determine the sharp asymptotic upper bound for $\lambda(G)$ in terms of $d_p(G)$ and $n$. More precisely, every $n$-vertex graph $G$ with at least one edge satisfies \[ \lamb…
-
On Minkowski space and finite geometryM. Orel · 2014 · Journal of Combinatorial Theory · cité 4 fois · Pas encore résumé
On Minkowski space and finite geometry étudie des applications préservant la relation de lumière dans des espaces finis, sans traiter la propriété d’isométrie restreinte.
Résumé scientifique
Abstract The main aim of this interdisciplinary paper is to characterize all maps on finite Minkowski space of arbitrary dimension n that map pairs of distinct light-like events into pairs of distinct light-like events. Neither bijectivity of maps nor preservation of light-likeness in the opposite direction, i.e. from codomain to domain, is assumed. We succeed in many cases, which include the one with n divisible by 4 and the one with n odd and ≥9, by showing that both bijectivity of maps and the preservation of light-likeness in the opposite direction are obtained automatically. In general, the problem of whether there exist non-bijective mappings that map pairs of distinct light-like event…
-
Discrete norms of a matrix and the converse to the Expander Mixing LemmaV. Lev · 2014 · arXiv: Combinatorics · preprint, non relu par les pairs · cité 4 fois · Pas encore résumé
Discrete norms of a matrix and the converse to the Expander Mixing Lemma établit des bornes de normes matricielles discrètes, sujet voisin du contrôle matriciel de cet article.
Résumé scientifique
We define the discrete norm of a complex $m\times n$ matrix $A$ by $$ \|A\|_\Delta := \max_{0\ne\xi\in\{0,1\}^n} \frac{\|A\xi\|}{\|\xi\|}, $$ and show that $$ \frac c{\sqrt{\log h(A)+1}}\,\|A\| \le \|A\|_\Delta \le \|A\|, $$ where $c>0$ is an explicitly indicated absolute constant, $h(A)=\sqrt{\|A\|_1\|A\|_\infty}/\|A\|$, and $\|A\|_1,\|A\|_\infty$, and $\|A\|=\|A\|_2$ are the induced operator norms of $A$. Similarly, for the \emph{discrete Rayleigh norm} $$ \|A\|_P := \max_{\substack{0\ne\xi\in\{0,1\}^m \\ 0\ne\eta\in\{0,1\}^n}} \frac{|\xi^tA\eta|}{\|\xi\|\|\eta\|} $$ we prove the estimate $$ \frac c{\log h(A)+1}\,\|A\| \le \|A\|_P \le \|A\|. $$ These estimates are shown to be essentially b…
-
Finite two-distance tight framesA. Barg, A. Glazyrin, Kasso Okoudjou et al. · 2014 · arXiv: Functional Analysis · preprint, non relu par les pairs · cité 48 fois · Pas encore résumé
Finite two-distance tight frames relie les graphes fortement réguliers aux cadres serrés à deux distances, tandis que cet article exploite ces graphes pour construire des matrices RIP.
Résumé scientifique
A finite collection of unit vectors $S \subset \mathbb{R}^n$ is called a spherical two-distance set if there are two numbers $a$ and $b$ such that the inner products of distinct vectors from $S$ are either $a$ or $b$. We prove that if $a\ne -b,$ then a two-distance set that forms a tight frame for $\mathbb{R}^n$ is a spherical embedding of a strongly regular graph, and every strongly regular graph gives rise to two-distance tight frames through standard spherical embeddings. Together with an earlier work by S. Waldron on the equiangular case ({\em Linear Alg. Appl.}, vol. 41, pp. 2228-2242, 2009) this completely characterizes two-distance tight frames. As an intermediate result, we obtain a …
-
Steiner equiangular tight framesM. Fickus, D. Mixon, J. Tremain · 2010 · Linear Algebra and its Applications · cité 214 fois · Pas encore résumé
Steiner equiangular tight frames construit des familles explicites de cadres serrés, mais ne traite pas la propriété d’isométrie restreinte.
Résumé scientifique
Abstract We provide a new method for constructing equiangular tight frames (ETFs). The construction is valid in both the real and complex settings, and shows that many of the few previously-known examples of ETFs are but the first representatives of infinite families of such frames. It provides great freedom in terms of the frame’s size and redundancy. This method also explicitly constructs the frame vectors in their native domain, as opposed to implicitly defining them via their Gram matrix. Moreover, in this domain, the frame vectors are very sparse. The construction is extremely simple: a tensor-like combination of a Steiner system and a regular simplex. This simplicity permits us to reso…
Aller plus loin
Comment ces articles sont-ils trouvés ?
Nous comparons le titre et le résumé de cet article avec ceux de tous les articles résumés sur ce site, et avec les articles que Semantic Scholar recommande, ceux qu’il cite et ceux qui le citent (pour un article très cité, ses citations les plus récentes et, depuis OpenAlex, les plus citées). Parmi les travaux antérieurs et les suites, les articles qui s’utilisent en profondeur, une méthode qu’il utilise et les suites très citées remontent un peu. Les niveaux (très proche, proche, apparenté) viennent de la similarité des textes, pas d’un jugement de qualité ; * signale un article sans résumé, comparé par son titre. La phrase sous un article est écrite par une IA à partir des deux résumés : vérifiez-la dans les articles. Un article jugé hors sujet par trois lecteurs quitte la liste.
Mis à jour le 16 novembre 2026.