Additive Combinatorics
By Terence Tao
2006
First Published
4.53
Average Rating
532
Number of Pages
Part of Series
Additive combinatorics is the theory of counting additive structures in sets. This theory has seen exciting developments and dramatic changes in direction in recent years thanks to its connections with areas such as number theory, ergodic theory and graph theory. This graduate-level 2006 text will allow students and researchers easy entry into this fascinating field. Here, the authors bring together in a self-contained and systematic manner the many different tools and ideas that are used in the modern theory, presenting them in an accessible, coherent, and intuitively clear manner, and providing immediate applications to problems in additive combinatorics. The power of these tools is well demonstrated in the presentation of recent advances such as Szemerédi's theorem on arithmetic progressions, the Kakeya conjecture and Erdos distance problems, and the developing field of sum-product estimates. The text is supplemented by a large number of exercises and new results.
Avg Rating
4.53
Number of Ratings
19
5 STARS
68%
4 STARS
21%
3 STARS
5%
2 STARS
5%
1 STARS
0%
goodreads
Author
Terence Tao
Author · 8 books
Terence "Terry" Tao FAA FRS (simplified Chinese: 陶哲轩; traditional Chinese: 陶哲軒; pinyin: Táo Zhéxuān) is an Australian-American mathematician who has worked in various areas of mathematics. He currently focuses on harmonic analysis, partial differential equations, algebraic combinatorics, arithmetic combinatorics, geometric combinatorics, compressed sensing and analytic number theory. As of 2015, he holds the James and Carol Collins chair in mathematics at the University of California, Los Angeles. Tao was a co-recipient of the 2006 Fields Medal and the 2014 Breakthrough Prize in Mathematics.
