Unexpected Applications of Polynomials in Combinatorics

Larry Guth ()
Additional contact information
Larry Guth: MIT, Department of Mathematics

A chapter in The Mathematics of Paul Erdős I, 2013, pp 493-522 from Springer

Abstract: 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 (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4614-7258-2_31

Ordering information: This item can be ordered from
http://www.springer.com/9781461472582

DOI: 10.1007/978-1-4614-7258-2_31

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().