English

Polynomial partitioning for a set of varieties

Algebraic Geometry 2015-10-28 v2 Combinatorics

Abstract

Given a set Γ\Gamma of low-degree k-dimensional varieties in Rn\mathbb{R}^n, we prove that for any D1D \ge 1, there is a non-zero polynomial PP of degree at most DD so that each component of RnZ(P)\mathbb{R}^n \setminus Z(P) intersects O(DknΓ)O(D^{k-n} |\Gamma|) varieties of Γ\Gamma.

Keywords

Cite

@article{arxiv.1410.8871,
  title  = {Polynomial partitioning for a set of varieties},
  author = {Larry Guth},
  journal= {arXiv preprint arXiv:1410.8871},
  year   = {2015}
}

Comments

11 pages. Revised to make the topological argument more accessible. Accepted for publication in Mathematical Proceedings of the Cambridge Philosophical Society