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.
- Graduate level text, now available in paperback, featuring a large number of exercises
- The authors bring together the many different tools and ideas that are used in the modern theory of additive combinatorics
- First author is a Fields Medallist
Read more
Reviews & endorsements
'The book under review is a vital contribution to the literature, and it has already become required reading for a new generation of students as well as for experts in adjacent areas looking to learn about additive combinatorics. … This was very much a book that needed to be written at the time it was, and the authors are to be highly commended for having done so in such an effective way.' Bulletin of the American Mathematical Society
'The book gathers diverse important techniques used in additive combinatorics, and its main advantage is that it is written in a very readable and easy to understand style. The authors try very successfully to develop all the necessary background material … [which] makes the book useful not only to graduate students, but also to researchers who are interested to learn more about the variety of diverse tools and ideas applied in this fascinating subject.' Zentralblatt MATH
See more reviews
Customer reviews

02nd Mar 2021 by Zhonghua
it is very attractive to me,i want to read it ,but it is too

Log in to review

Review was not posted due to profanity
×

, create a review

(If you're not , sign out)

Please enter the right captcha value

Please enter a star rating.

Your review must be a minimum of 12 words.

How do you rate this item?

Reviews must contain at least 12 words about the product.

×

Product details
- Date Published: November 2009
- format: Paperback
- isbn: 9780521136563
- length: 532 pages
- dimensions: 229 x 152 x 30 mm
- weight: 0.75kg
- contains: 640 exercises
- availability: Available
Table of Contents
Prologue
1. The probabilistic method
2. Sum set estimates
3. Additive geometry
4. Fourier-analytic methods
5. Inverse sum set theorems
6. Graph-theoretic methods
7. The Littlewood–Offord problem
8. Incidence geometry
9. Algebraic methods
10. Szemerédi's theorem for k = 3
11. Szemerédi's theorem for k > 3
12. Long arithmetic progressions in sum sets
Bibliography
Index.
Look Inside

General Resources

Resources

Find resources associated with this title

Back to resources home

Type	Name	Unlocked *	Format	Size

Showing of

This title is supported by one or more locked resources. Access to locked resources is granted exclusively by Cambridge University Press to lecturers whose faculty status has been verified. To gain access to locked resources, lecturers should sign in to or register for a Cambridge user account.

Please use locked resources responsibly and exercise your professional discretion when choosing how you share these materials with your students. Other lecturers may wish to use locked resources for assessment purposes and their usefulness is undermined when the source files (for example, solution manuals or test banks) are shared online or via social networks.

Supplementary resources are subject to copyright. Lecturers are permitted to view, print or download these resources for use in their teaching, but may not change them or use them for commercial gain.

If you are having problems accessing these resources please contact lecturers@cambridge.org.

Authors
Terence Tao, University of California, Los Angeles
Terence Tao is a Professor in the Department of Mathematics at the University of California, Los Angeles. He was awarded the Fields Medal in 2006 for his contributions to partial differential equations, combinatorics, harmonic analysis and additive number theory.
Van H. Vu, Rutgers University, New Jersey
Van H. Vu is a Professor in the Department of Mathematics at Rutgers University, New Jersey.