Polynomial partitioning for a set of varieties
arXiv:1410.8871 · doi:10.1017/S0305004115000468
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 .
arXiv comment11 pages. Revised to make the topological argument more accessible. Accepted for publication in Mathematical Proceedings of the Cambridge Philosophical Society
References in corpus (3)
Cited by in corpus (12)
- Cutting Algebraic Curves into Pseudo-segments and Applications
- Breaking the 3/2 barrier for unit distances in three dimensions
- An Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications
- Distinct distances in the complex plane
- Distinct and repeated distances on a surface and incidences between points and spheres
- Constructive Polynomial Partitioning for Algebraic Curves in with Applications
- Curves in and two-rich points
- Sphere tangencies, line incidences, and Lie's line-sphere correspondence
- Joints of varieties
- Almost Tight Bounds for Eliminating Depth Cycles in Three Dimensions
- Removing Depth-Order Cycles Among Triangles: An Efficient Algorithm Generating Triangular Fragments
- Incidences with curves in three dimensions