arXiv · 1410.8871
Polynomial partitioning for a set of varieties
Abstract
Given a set $Γ$ of low-degree k-dimensional varieties in $\mathbb{R}^n$, we prove that for any $D \ge 1$, there is a non-zero polynomial $P$ of degree at most $D$ so that each component of $\mathbb{R}^n \setminus Z(P)$ intersects $O(D^{k-n} |Γ|)$ varieties of $Γ$.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Larry Guth. 2015-07-02. Polynomial partitioning for a set of varieties. https://doi.org/10.1017/s0305004115000468
Cite the original work for its findings. Save a collection to share your selection of sources.