2026-08-17T09:37:17Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:18290 2024-03-06T11:01:31Z ddc:004 open_access

Radical Sylvester-Gallai Theorem for Tuples of Quadratics Garg, Abhibhav Oliveira, Rafael Peleg, Shir Sengupta, Akash Kumar Sylvester-Gallai theorem arrangements of hypersurfaces algebraic complexity polynomial identity testing algebraic geometry commutative algebra We prove a higher codimensional radical Sylvester-Gallai type theorem for quadratic polynomials, simultaneously generalizing [Hansen, 1965; Shpilka, 2020]. Hansen’s theorem is a high-dimensional version of the classical Sylvester-Gallai theorem in which the incidence condition is given by high-dimensional flats instead of lines. We generalize Hansen’s theorem to the setting of quadratic forms in a polynomial ring, where the incidence condition is given by radical membership in a high-codimensional ideal. Our main theorem is also a generalization of the quadratic Sylvester-Gallai Theorem of [Shpilka, 2020]. Our work is the first to prove a radical Sylvester-Gallai type theorem for arbitrary codimension k ≥ 2, whereas previous works [Shpilka, 2020; Shir Peleg and Amir Shpilka, 2020; Shir Peleg and Amir Shpilka, 2021; Garg et al., 2022] considered the case of codimension 2 ideals. Our techniques combine algebraic geometric and combinatorial arguments. A key ingredient is a structural result for ideals generated by a constant number of quadratics, showing that such ideals must be radical whenever the quadratic forms are far apart. Using the wide algebras defined in [Garg et al., 2022], combined with results about integral ring extensions and dimension theory, we develop new techniques for studying such ideals generated by quadratic forms. One advantage of our approach is that it does not need the finer classification theorems for codimension 2 complete intersection of quadratics proved in [Shpilka, 2020; Garg et al., 2022]. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Abhibhav Garg and Rafael Oliveira and Shir Peleg and Akash Kumar Sengupta 2023 Is Part Of LIPIcs, Volume 264, 38th Computational Complexity Conference (CCC 2023) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.CCC.2023.20 urn:nbn:de:0030-drops-182903 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2023.20 eng https://creativecommons.org/licenses/by/4.0/legalcode