Polynomial Methods in Combinatorics

Name: Polynomial Methods in Combinatorics
Rating: 5 (1 reviews)

Larry Guth

2016年6月 · University Lecture Series 第 64 冊 · American Mathematical Soc.

5.0

1 則評論

電子書

273

頁

評分和評論未經驗證瞭解詳情

關於本電子書

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.