Radical Sylvester-Gallai Theorem for Cubics
Rafael Oliveira, Akash Kumar Sengupta
Abstract
Let F = tF 1 , . . . , F m u be a finite set of irreducible homogeneous multivariate polynomials of degree at most 3 such that F i does not divide F j for i ‰ j. We say that F is a cubic radical Sylvester-Gallai configuration if for any two distinct F i , F j there exists a third polynomial F k such that whenever F i , F j vanish, F k also vanishes. In particular, for any two indices i, j P [m], there exists k P [m]zti, ju such that F k P rad(F i , F j ).
We prove that any cubic radical Sylvester-Gallai configuration is low-dimensional, that is
This solves a conjecture of Gupta [Gup14] in degree 3 and generalizes the result in [Shp20], which proved that quadratic radical Sylvester-Gallai configurations are low-dimensional. Our result takes us one step closer towards solving the non-linear Sylvester-Gallai conjectures of Gupta [Gup14], which would yield the first deterministic polynomial time algorithm for the PIT problem for depth-4 circuits of bounded top and bottom fanins.
To prove our Sylvester-Gallai theorem, we develop several new tools combining techniques from algebraic geometry and elimination theory. Among our technical contributions, we prove a structure theorem characterizing non-radical ideals generated by two cubic forms, generalizing the structure theorems of [HP94, CTSSD87, Shp20]. Moreover, building upon the groundbreaking work [AH20a], we introduce the notion of wide Ananyan-Hochster algebras and show that these algebras allow us to transfer the local conditions of Sylvester-Gallai configurations into global conditions.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 33310c96-fd03-4dbe-b058-4db2444c64e3Cited by top-tier papers2
- Reconstruction of Depth-3 Arithmetic Circuits with Constant Top Fan-InShubhangi Saraf, Devansh Shringi, Narmada VaradarajanSTOC 2026 · 2 citations
- Strong Algebras and Radical Sylvester-Gallai ConfigurationsRafael Oliveira, Akash Kumar SenguptaSTOC 2024 · 1 citation
Builds on2
- Superpolynomial Lower Bounds Against Low-Depth Algebraic CircuitsNutan Limaye, Srikanth Srinivasan, Sébastien TavenasFOCS 2021 · 26 citations
- Polynomial time deterministic identity testing algorithm for Σ[3]ΠΣΠ[2] circuits via Edelstein-Kelly type theorem for quadratic polynomialsShir Peleg, Amir ShpilkaSTOC 2021 · 9 citations
Related papers
- Rank Bounds and PIT for depth-4 circuits with top fan-in 3 and constant bottom fan-in via a non-linear Edelstein-Kelly theoremAbhibhav Garg, Rafael Oliveira, Akash Kumar SenguptaFOCS 2025 · 2 citations
- Identity Testing for Radical ExpressionsNikhil Balaji, Klara Nosan, Mahsa Shirmohammadi, James WorrellLICS 2022 · 4 citations
- Feasibly Constructive Proof of Schwartz-Zippel Lemma and the Complexity of Finding Hitting SetsAlbert Atserias, Iddo TzameretSTOC 2025 · 1 citation
- Linear Independence, Alternants, and ApplicationsVishwas Bhargava, Shubhangi Saraf, Ilya VolkovichSTOC 2023 · 1 citation
- Learning sums of powers of low-degree polynomials in the non-degenerate caseAnkit Garg, Neeraj Kayal, Chandan SahaFOCS 2020 · 9 citations
