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.

Degree reduction and graininess for Kakeya-type sets in R[superscript 3]

Author(s)
Guth, Lawrence
Thumbnail
Download1402.0518.pdf (457.6Kb)
OPEN_ACCESS_POLICY

Open Access Policy

Creative Commons Attribution-Noncommercial-Share Alike

Terms of use
Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/
Metadata
Show full item record
Abstract
Let T be a set of cylindrical tubes in ℝ[superscrpit 3] of length N and radius 1. If the union of the tubes has volume N[superscript 3-σ], and each point in the union lies in tubes pointing in three quantitatively different directions, and if a technical assumption holds, then at scale N[superscript σ ], the tubes are clustered into rectangular slabs of dimension 1 x N[superscript σ] x N[superscript σ]. This estimate generalizes the graininess estimate in [7]. The proof is based on modeling the union of tubes with a high-degree polynomial. Keywords: Kakeya set, incidence geometry, polynomial method
Date issued
2016-06
URI
http://hdl.handle.net/1721.1/115569
Department
Massachusetts Institute of Technology. Department of Mathematics
Journal
Revista Matemática Iberoamericana
Publisher
European Mathematical Publishing House
Citation
Guth, Larry. “Degree Reduction and Graininess for Kakeya-Type Sets in R[superscript 3].” Revista Matemática Iberoamericana, vol. 32, no. 2, 2016, pp. 447–94.
Version: Original manuscript
ISSN
0213-2230

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.