You can manage bookmarks using lists, please log in to your user account for this.
Media type:
E-Article
Title:
Polynomial partitioning for a set of varieties
Contributor:
GUTH, LARRY
Published:
Cambridge University Press (CUP), 2015
Published in:
Mathematical Proceedings of the Cambridge Philosophical Society, 159 (2015) 3, Seite 459-469
Language:
English
DOI:
10.1017/s0305004115000468
ISSN:
0305-0041;
1469-8064
Origination:
Footnote:
Description:
AbstractGiven a set Γ of low-degree k-dimensional varieties in$\mathbb{R}$n, we prove that for anyD⩾ 1, there is a non-zero polynomialPof degree at mostDso that each component of$\mathbb{R}$n\Z(P) intersectsO(Dk−n|Γ|) varieties of Γ.