Skip to content
Register Sign in Wishlist

Additive Combinatorics

$55.99 (P)

Part of Cambridge Studies in Advanced Mathematics

  • Date Published: December 2009
  • availability: Available
  • format: Paperback
  • isbn: 9780521136563

$ 55.99 (P)
Paperback

Add to cart Add to wishlist

Other available formats:
Hardback, eBook


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 collegesales@cambridge.org providing details of the course you are teaching.

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • 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

    "... 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

    Customer reviews

    Not yet reviewed

    Be the first 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?

    ×

    Product details

    • Date Published: December 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.

  • Resources for

    Additive Combinatorics

    Terence Tao, Van H. Vu

    General Resources

    Find resources associated with this title

    Type Name Unlocked * Format Size

    Showing of

    Back to top

    This title is supported by one or more locked resources. Access to locked resources is granted exclusively by Cambridge University Press to instructors whose faculty status has been verified. To gain access to locked resources, instructors 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 instructors 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. Instructors 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.

Sign In

Please sign in to access your account

Cancel

Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email lecturers@cambridge.org

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.

Cancel

Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

×
Please fill in the required fields in your feedback submission.
×