A generalized Sylvester–Gallai-type theorem for quadratic polynomials

DOI10.1017/fms.2022.100OpenAlexW3012466737MaRDI QIDQ5058240

Shir Peleg, Amir Shpilka

Publication date: 19 December 2022

Published in: Forum of Mathematics, Sigma (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/fms.2022.100

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Cites Work

• Tight lower bounds for linear \(2\)-query LCCs over finite fields. With an appendix by Sergey Yekhanin.
• A resolution of the Sylvester-Gallai problem of J.-P. Serre
• Algebraic independence and blackbox identity testing
• A survey of Sylvester's problem and its generalizations
• IMPROVED RANK BOUNDS FOR DESIGN MATRICES AND A NEW PROOF OF KELLY’S THEOREM
• Interpolation of Depth-3 Arithmetic Circuits with Two Multiplication Gates
• A generalized sylvester-gallai type theorem for quadratic polynomials
• Sylvester-Gallai type theorems for quadratic polynomials
• Fractional Sylvester–Gallai theorems
• Bisecants of Finite Collections of Sets in Linear Spaces
• Polynomial time deterministic identity testing algorithm for Σ ^[3 ΠΣΠ ^[2] circuits via Edelstein–Kelly type theorem for quadratic polynomials]
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A generalized Sylvester–Gallai-type theorem for quadratic polynomials