2000 character limit reached
On the restricted isometry property of the Paley matrix
Published 19 Oct 2020 in math.CO, cs.IT, and math.IT | (2011.02907v2)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.