Polynomial Methods in Combinatorics

by Larry Guth

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.

273 pages, Paperback

Published July 20, 2016

Reviews

[Medhat ullah · Rating 3 out of 5]

Pólya’s Enumeration Theorem, Polynomials in Permutation Enumeration, Hall’s Marriage Theorem and Polynomials, Lagrange Inversion Formula, Positivity of Polynomial Coefficients, Ordinary Generating Functions (OGF)s