Polynomial Methods In Combinatorics
Download Polynomial Methods In Combinatorics full books in PDF, epub, and Kindle. Read online free Polynomial Methods In Combinatorics ebook anywhere anytime directly on your device. Fast Download speed and no annoying ads. We cannot guarantee that every ebooks is available!
Polynomial Methods in Combinatorics
Author | : Larry Guth |
Publisher | : American Mathematical Soc. |
Total Pages | : 287 |
Release | : 2016-06-10 |
Genre | : Mathematics |
ISBN | : 1470428903 |
Download Polynomial Methods in Combinatorics Book in PDF, Epub and Kindle
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 Erdős'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.
Polynomial Methods in Combinatorics Related Books
Pages: 287
Pages: 442
Pages: 263
Pages: 389
Pages: 825