Additive Combinatorics

Front Cover
Cambridge University Press, Sep 14, 2006 - Mathematics
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.
 

Selected pages

Other editions - View all

Common terms and phrases

Popular passages

Page 488 - A LOWER BOUND FOR THE VOLUME OF STRICTLY CONVEX BODIES WITH MANY BOUNDARY LATTICE POINTS BY GEORGE E.
Page 488 - References 1. M. Ajtai, V. Chvatal, M. Newborn, and E. Szemeredi: Crossing-free subgraphs. Annals of Discrete Mathematics 12 (1982), 9-12 2.

About the author (2006)

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 is a Professor in the Department of Mathematics at Rutgers University, New Jersey.

Bibliographic information