Home
»
Polynomial Methods in Combinatorics
Polynomial Methods in Combinatorics
Regular price
€71.99
596 verified reviews
100% verified
Delivery/Collection within 10-20 working days
Shipping & Delivery
Shipping & Delivery
Our Delivery Time Frames Explained
2-4 Working Days: Available in-stock
10-20 Working Days: On Backorder
Will Deliver When Available: On Pre-Order or Reprinting
We ship your order once all items have arrived at our warehouse and are processed. Need those 2-4 day shipping items sooner? Just place a separate order for them!
Close
A01=Larry Guth
Author_Larry Guth
Category=PBD
Category=PBM
Category=PBP
Category=PBV
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
Product details
- ISBN 9781470428907
- Weight: 505g
- Dimensions: 178 x 254mm
- Publication Date: 30 May 2016
- Publisher: American Mathematical Society
- Publication City/Country: US
- Product Form: Paperback
This book explains some recent applications of the theory of polynomials and algebraic geometry to combinatorics and other areas of mathematics. One of the first results in this story is a short elegant solution of the Kakeya problem for finite fields, which was considered a deep and difficult problem in combinatorial geometry. The author also discusses in detail various problems in incidence geometry associated to Paul Erdos's famous distinct distances problem in the plane from the 1940s. The proof techniques are also connected to error-correcting codes, Fourier analysis, number theory, and differential geometry. Although the mathematics discussed in the book is deep and far-reaching, it should be accessible to first- and second-year graduate students and advanced undergraduates. The book contains approximately 100 exercises that further the reader's understanding of the main themes of the book.
Larry Guth, Massachusetts Institute of Technology, Cambridge, MA, USA.
Polynomial Methods in Combinatorics
€71.99
