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.

Unexpected Applications of Polynomials in Combinatorics

Author(s)
Guth, Lawrence
Thumbnail
Downloaderdossurvey.pdf (260.3Kb)
OPEN_ACCESS_POLICY

Open Access Policy

Creative Commons Attribution-Noncommercial-Share Alike

Alternative title
The Mathematics of Paul Erdős
Terms of use
Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/
Metadata
Show full item record
Abstract
In the last 6 years, several combinatorics problems have been solved in an unexpected way using high degree polynomials. The most well-known of these problems is the distinct distance problem in the plane. Keywords: Algebraic Structure, Finite Field, Combinatorial Structure, Joint Problem, Partial Symmetry
Date issued
2013-05
URI
http://hdl.handle.net/1721.1/115560
Department
Massachusetts Institute of Technology. Department of Mathematics
Publisher
Springer
Citation
Guth, Larry. “Unexpected Applications of Polynomials in Combinatorics.” The Mathematics of Paul Erdős I, edited by Ronald L. Graham et al., Springer New York, 2013, pp. 493–522.
Version: Author's final manuscript
ISBN
9781461472582

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.