MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

A restriction estimate using polynomial partitioning

Author(s)
Guth, Lawrence
Thumbnail
DownloadS0894-0347-2015-00827-X.pdf (507.4Kb)
PUBLISHER_POLICY

Publisher Policy

Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.

Terms of use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Metadata
Show full item record
Abstract
If S is a smooth compact surface in ℝ[superscript 3] with strictly positive second fundamental form, and E [subscript S] is the corresponding extension operator, then we prove that for all [Formula presented]. The proof uses polynomial partitioning arguments from incidence geometry.
Date issued
2015-05
URI
http://hdl.handle.net/1721.1/115579
Department
Massachusetts Institute of Technology. Department of Mathematics
Journal
Journal of the American Mathematical Society
Publisher
American Mathematical Society (AMS)
Citation
Guth, Larry. “A Restriction Estimate Using Polynomial Partitioning.” Journal of the American Mathematical Society 29, 2 (May 2015): 371–413 © 2015 American Mathematical Society
Version: Final published version
ISSN
0894-0347
1088-6834

Collections
  • MIT Open Access Articles

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.