$45.00 ( ) USD
Adobe eBook Reader
Looking for an examination copy?
If you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact email@example.com providing details of the course you are teaching.
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.Read more
- 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
Reviews & endorsements
"... 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. I have three copies myself: one at home, one in the office, and a spare in case either of those should become damaged."
Bulletin of the AMS
Not yet reviewed
Be the first to review
Review was not posted due to profanity×
- Date Published: November 2006
- format: Adobe eBook Reader
- isbn: 9780511243059
- contains: 640 exercises
- availability: This ISBN is for an eBook version which is distributed on our behalf by a third party.
Table of Contents
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
Find resources associated with this titleYour search for '' returned .
Type Name Unlocked * Format Size
*This title has one or more locked files and access is given only to instructors adopting the textbook for their class. We need to enforce this strictly so that solutions are not made available to students. To gain access to locked resources you either need first to sign in or register for an account.
These resources are provided free of charge by Cambridge University Press with permission of the author of the corresponding work, but are subject to copyright. You are permitted to view, print and download these resources for your own personal use only, provided any copyright lines on the resources are not removed or altered in any way. Any other use, including but not limited to distribution of the resources in modified form, or via electronic or other media, is strictly prohibited unless you have permission from the author of the corresponding work and provided you give appropriate acknowledgement of the source.
If you are having problems accessing these resources please email firstname.lastname@example.org
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email email@example.comRegister Sign in