Show simple item record

dc.contributor.authorGUTH, LARRY
dc.date.accessioned2017-06-26T21:38:04Z
dc.date.available2017-06-26T21:38:04Z
dc.date.issued2015-09
dc.date.submitted2015-07
dc.identifier.issn0305-0041
dc.identifier.issn1469-8064
dc.identifier.urihttp://hdl.handle.net/1721.1/110285
dc.description.abstractGiven 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 Γ.en_US
dc.language.isoen_US
dc.publisherCambridge University Pressen_US
dc.relation.isversionofhttp://dx.doi.org/10.1017/S0305004115000468en_US
dc.rightsCreative Commons Attribution-Noncommercial-Share Alikeen_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/4.0/en_US
dc.sourcearXiven_US
dc.titlePolynomial partitioning for a set of varietiesen_US
dc.typeArticleen_US
dc.identifier.citationGUTH, LARRY. “Polynomial Partitioning for a Set of Varieties.” Mathematical Proceedings of the Cambridge Philosophical Society 159, no. 03 (September 30, 2015): 459–469.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Mathematics
dc.relation.journalMathematical Proceedings of the Cambridge Philosophical Societyen_US
dc.eprint.versionOriginal manuscripten_US
dc.type.urihttp://purl.org/eprint/type/JournalArticleen_US
eprint.statushttp://purl.org/eprint/status/NonPeerRevieweden_US
dspace.orderedauthorsGUTH, LARRYen_US
dspace.embargo.termsNen_US
mit.licenseOPEN_ACCESS_POLICYen_US
mit.metadata.statusComplete


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record