Polynomial partitioning for a set of varieties
Algebraic Geometry
2015-10-28 v2 Combinatorics
Abstract
Given a set of low-degree k-dimensional varieties in , we prove that for any , there is a non-zero polynomial of degree at most so that each component of intersects varieties of .
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