Search  for anything...

Additive Combinatorics (Cambridge Studies in Advanced Mathematics, Series Number 105)

  • Based on 8 reviews
Condition: New
Checking for product changes

Buy Now, Pay Later


As low as $11.17 / mo
  • – 6-month term
  • – No impact on credit
  • – Instant approval decision
  • – Secure and straightforward checkout

Ready to go? Add this product to your cart and select a plan during checkout. Payment plans are offered through our trusted finance partners Klarna, PayTomorrow, Affirm, Afterpay, Apple Pay, and PayPal. No-credit-needed leasing options through Acima may also be available at checkout.

Learn more about financing & leasing here.

Selected Option

Free shipping on this product

This item is eligible for return within 30 days of receipt

To qualify for a full refund, items must be returned in their original, unused condition. If an item is returned in a used, damaged, or materially different state, you may be granted a partial refund.

To initiate a return, please visit our Returns Center.

View our full returns policy here.


Availability: Only 1 left in stock, order soon!
Fulfilled by Amazon

Arrives Thursday, Dec 26
Order within 15 hours and 11 minutes
Available payment plans shown during checkout

Format: Paperback


Description

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


Publisher ‏ : ‎ Cambridge University Press; 1st edition (December 21, 2009)


Language ‏ : ‎ English


Paperback ‏ : ‎ 532 pages


ISBN-10 ‏ : ‎ 0521136563


ISBN-13 ‏ : ‎ 63


Item Weight ‏ : ‎ 1.65 pounds


Dimensions ‏ : ‎ 6 x 1.33 x 9 inches


Best Sellers Rank: #1,578,070 in Books (See Top 100 in Books) #206 in Combinatorics (Books) #275 in Graph Theory (Books) #913 in Mathematical Analysis (Books)


#206 in Combinatorics (Books):


#275 in Graph Theory (Books):


Frequently asked questions

If you place your order now, the estimated arrival date for this product is: Thursday, Dec 26

Yes, absolutely! You may return this product for a full refund within 30 days of receiving it.

To initiate a return, please visit our Returns Center.

View our full returns policy here.

  • Klarna Financing
  • Affirm Pay in 4
  • Affirm Financing
  • Afterpay Financing
  • PayTomorrow Financing
  • Financing through Apple Pay
Leasing options through Acima may also be available during checkout.

Learn more about financing & leasing here.

Top Amazon Reviews


  • I've read it three times from cover to cover. ...
I've read it three times from cover to cover. It is an unbelievably rich book of unexpected depth. It will become a classic.
Reviewed in the United States on October 10, 2014 by Dr. Gabor Korvin

Can't find a product?

Find it on Amazon first, then paste the link below.