SYLVESTER–GALLAI TYPE THEOREMS FOR APPROXIMATE COLLINEARITY
From MaRDI portal
Publication:2879416
DOI10.1017/fms.2014.1zbMath1316.94129arXiv1211.0331OpenAlexW2962882649MaRDI QIDQ2879416
Avi Wigderson, Albert Ai, Zeev Dvir, Shubhangi Saraf
Publication date: 1 September 2014
Published in: Forum of Mathematics, Sigma (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1211.0331
Bounds on codes (94B65) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On matrix rigidity and locally self-correctable codes
- A remark on compressed sensing
- A resolution of the Sylvester-Gallai problem of J.-P. Serre
- A survey of Sylvester's problem and its generalizations
- The variation of the spectrum of a normal matrix
- Incidence Theorems and Their Applications
- IMPROVED RANK BOUNDS FOR DESIGN MATRICES AND A NEW PROOF OF KELLY’S THEOREM
- On the efficiency of local decoding procedures for error-correcting codes
- Decoding by Linear Programming
- Perturbed Identity Matrices Have High Rank: Proof and Applications
- Rank bounds for design matrices with applications to combinatorial geometry and locally correctable codes
- Tight Lower Bounds for 2-query LCCs over Finite Fields
- Locally Decodable Codes
- Compressed sensing
- Exponential lower bound for 2-query locally decodable codes via a quantum argument
