Robust Radical Sylvester-Gallai Theorem for Quadratics
Discrete Mathematics
2022-03-11 v1 Computational Complexity
Computational Geometry
Combinatorics
Abstract
We prove a robust generalization of a Sylvester-Gallai type theorem for quadratic polynomials, generalizing the result in [S'20]. More precisely, given a parameter and a finite collection of irreducible and pairwise independent polynomials of degree at most 2, we say that is a -radical Sylvester-Gallai configuration if for any polynomial , there exist polynomials such that , that is, the radical of contains a third polynomial in the set. In this work, we prove that any -radical Sylvester-Gallai configuration must be of low dimension: that is
Cite
@article{arxiv.2203.05532,
title = {Robust Radical Sylvester-Gallai Theorem for Quadratics},
author = {Abhibhav Garg and Rafael Oliveira and Akash Sengupta},
journal= {arXiv preprint arXiv:2203.05532},
year = {2022}
}
Comments
41 pages