Sylvester-Gallai for arrangements of subspaces

DOI10.1007/s00454-016-9781-7zbMath1356.52012OpenAlexW1906753399MaRDI QIDQ728498

Zeev Dvir, Guang-Da Hu

Publication date: 20 December 2016

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-016-9781-7

zbMATH Keywords

incidence geometrylocally correctable codesSylvester-Gallai

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10) Discrete geometry (52C99)

Related Items (1)

Sylvester-Gallai type theorems for quadratic polynomials

Cites Work

• Unnamed Item
• On matrix rigidity and locally self-correctable codes
• A resolution of the Sylvester-Gallai problem of J.-P. Serre
• On a reverse form of the Brascamp-Lieb inequality
• The Brascamp-Lieb inequalities: Finiteness, structure and extremals
• Sylvester-Gallai theorems for complex numbers and quaternions
• A survey of Sylvester's problem and its generalizations
• IMPROVED RANK BOUNDS FOR DESIGN MATRICES AND A NEW PROOF OF KELLY’S THEOREM
• Fractional Sylvester–Gallai theorems
• Breaking the quadratic barrier for 3-LCC's over the reals
• Rank bounds for design matrices with applications to combinatorial geometry and locally correctable codes
• A Generalization of a Theorem of Sylvester on the Lines Determined by a Finite Point Set.

This page was built for publication: Sylvester-Gallai for arrangements of subspaces