Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have