Polynomial partitioning for a set of varieties
Name
Guth_Polynomial partitioning.pdf
Size
155.64 KB
Format
Adobe PDF
Checksum (MD5)
6c3261e6da4edb17a287da63ff80be40
Author(s)
GUTH, LARRY
Date Issued
September 2015
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
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 Γ.
MIT Department
Massachusetts Institute of Technology. Department of Mathematics
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1017/S0305004115000468
