Polynomial partitioning for a set of varieties

Author(s)
GUTH, LARRY
Thumbnail
DownloadGuth_Polynomial partitioning.pdf (155.6Kb)
OPEN_ACCESS_POLICY
Terms of use
Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/
Metadata
Show full item record
Abstract
Given a set Γ of low-degree k-dimensional varieties in R[superscript n], we prove that for any D ⩾ 1, there is a non-zero polynomial P of degree at most D so that each component of R[superscript n]\Z(P) intersects O(D[superscript k−n]|Γ|) varieties of Γ.
Date issued
2015-09
URI
http://hdl.handle.net/1721.1/110285
Department
Massachusetts Institute of Technology. Department of Mathematics
Journal
Mathematical Proceedings of the Cambridge Philosophical Society
Publisher
Cambridge University Press
Citation
GUTH, LARRY. “Polynomial Partitioning for a Set of Varieties.” Mathematical Proceedings of the Cambridge Philosophical Society 159, no. 03 (September 30, 2015): 459–469.
Version: Original manuscript
ISSN
0305-0041
1469-8064
Collections