Polynomial Methods in Combinatorics (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.

General

Imprint:	American Mathematical Society
Country of origin:	United States
Series:	University Lecture Series
Release date:	March 2017
Authors:	Larry Guth
Dimensions:	254 x 178 x 16mm (L x W x T)
Format:	Paperback
Pages:	273
ISBN-13:	978-1-4704-2890-7
Categories:	Books > Science & Mathematics > Mathematics > Combinatorics & graph theory Books > Science & Mathematics > Mathematics > Geometry > General Books > Science & Mathematics > Mathematics > Topology > General
LSN:	1-4704-2890-3
Barcode:	9781470428907

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!