On the restricted isometry property of the Paley matrix

10/19/2020
by   Shohei Satake, et al.
0

In this paper, we prove that the Paley graph conjecture implies that the Paley matrix has restricted isometry property (RIP) beating the square-root bottleneck for the sparsity level. Moreover, we show that the RIP of the Paley matrix implies an improved bound on the size of transitive subtournaments in the Paley tournament.

READ FULL TEXT
research
10/21/2020

On Compressed Sensing Matrices Breaking the Square-Root Bottleneck

Compressed sensing is a celebrated framework in signal processing and ha...
research
06/29/2016

Small coherence implies the weak Null Space Property

In the Compressed Sensing community, it is well known that given a matri...
research
09/25/2019

Three Dimensional Sums of Character Gabor Systems

In deterministic compressive sensing, one constructs sampling matrices t...
research
08/31/2018

Graph reduction by local variation

How can we reduce the size of a graph without significantly altering its...
research
03/28/2019

Improved Lower Bounds for the Restricted Isometry Property of Subsampled Fourier Matrices

Let A be an N × N Fourier matrix over F_p^N/p for some prime p. We impro...
research
05/29/2018

Explicit construction of RIP matrices is Ramsey-hard

Matrices Φ∈^n× p satisfying the Restricted Isometry Property (RIP) are a...
research
06/28/2017

Generalized notions of sparsity and restricted isometry property. Part II: Applications

The restricted isometry property (RIP) is a universal tool for data reco...

Please sign up or login with your details

Forgot password? Click here to reset