Polynomial Methods in Combinatorics

出版刊物 盘天下 2025-02-04 1175 0

Polynomial Methods in Combinatorics

内容简介

This book explains some recent applications of the theory of polynomials and algebraic geometry to combinatorics and other areas of mat hematics. 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.

下载地址

夸克资源精选合集

(0)
(0)

评论列表