English

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 0<δ10 < \delta \leq 1 and a finite collection F\mathcal{F} of irreducible and pairwise independent polynomials of degree at most 2, we say that F\mathcal{F} is a (δ,2)(\delta, 2)-radical Sylvester-Gallai configuration if for any polynomial FiFF_i \in \mathcal{F}, there exist δ(F1)\delta(|\mathcal{F}| -1) polynomials FjF_j such that rad(Fi,Fj)F3|\mathrm{rad}(F_i, F_j) \cap \mathcal{F}| \geq 3, that is, the radical of Fi,FjF_i, F_j contains a third polynomial in the set. In this work, we prove that any (δ,2)(\delta, 2)-radical Sylvester-Gallai configuration F\mathcal{F} must be of low dimension: that is dimspan(F)=poly(1/δ).\dim \mathrm{span}(\mathcal{F}) = \mathrm{poly}(1/\delta).

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

R2 v1 2026-06-24T10:09:02.000Z