Strong Algebras and Radical Sylvester-Gallai Configurations
Rafael Oliveira, Akash Kumar Sengupta
摘要
In this paper, we prove the following non-linear generalization of the classical Sylvester-Gallai theorem. Let K be an algebraically closed field of characteristic 0 and F = tF 1 , ¨¨¨, F m u Ă K[x 1 , ¨¨¨, x N ] be a set of irreducible homogeneous polynomials of degree at most d such that F i is not a scalar multiple of F j for i ‰ j. Suppose that for any two distinct F i , F j P F, there is k ‰ i, j such that F k P rad(F i , F j ). We prove that such radical SG configurations must be low dimensional. More precisely, we show that there exists a function λ : N Ñ N, independent of K, N and m, such that any such configuration F must satisfy dim(span K tFu) ď λ(d).
Our result confirms a conjecture of Gupta [Gup14, Conjecture 2] and generalizes the quadratic and cubic Sylvester-Gallai theorems of [Shp20, OS22]. Our result takes us one step closer towards the first deterministic polynomial time algorithm for the Polynomial Identity Testing (PIT) problem for depth-4 circuits of bounded top and bottom fanins. Our result, when combined with the Stillman uniformity type results of [AH20a, DLL19, ESS21], yields uniform bounds for several algebraic invariants such as projective dimension, Betti numbers and Castelnuovo-Mumford regularity of ideals generated by radical SG configurations.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper1
问问它们各自怎么用它它引用的顶会 Paper3
- Superpolynomial Lower Bounds Against Low-Depth Algebraic CircuitsNutan Limaye, Srikanth Srinivasan, Sébastien TavenasFOCS 2021 · 被引用 26 次
- Ideals, determinants, and straightening: proving and using lower bounds for polynomial idealsRobert Andrews, Michael A. ForbesSTOC 2022 · 被引用 6 次
- Radical Sylvester-Gallai Theorem for CubicsRafael Oliveira, Akash Kumar SenguptaFOCS 2022 · 被引用 3 次
相关 Paper
- 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 次
- Symbolic determinant identity testing (SDIT) is not a null cone problem; and the symmetries of algebraic varietiesVisu Makam, Avi WigdersonFOCS 2020 · 被引用 2 次
- Polynomial time deterministic identity testing algorithm for Σ[3]ΠΣΠ[2] circuits via Edelstein-Kelly type theorem for quadratic polynomialsShir Peleg, Amir ShpilkaSTOC 2021 · 被引用 9 次
- Deterministic Algorithms for Low Degree Factors of Constant Depth CircuitsMrinal Kumar, Varun Ramanathan, Ramprasad SaptharishiSODA 2024 · 被引用 2 次
- Small Covers for Near-Zero Sets of Polynomials and Learning Latent Variable ModelsIlias Diakonikolas, Daniel M. KaneFOCS 2020 · 被引用 11 次
