Softcover ISBN: | 978-0-8218-4351-2 |
Product Code: | CRMP/43 |
List Price: | $118.00 |
MAA Member Price: | $106.20 |
AMS Member Price: | $94.40 |
eBook ISBN: | 978-1-4704-3957-6 |
Product Code: | CRMP/43.E |
List Price: | $111.00 |
MAA Member Price: | $99.90 |
AMS Member Price: | $88.80 |
Softcover ISBN: | 978-0-8218-4351-2 |
eBook: ISBN: | 978-1-4704-3957-6 |
Product Code: | CRMP/43.B |
List Price: | $229.00 $173.50 |
MAA Member Price: | $206.10 $156.15 |
AMS Member Price: | $183.20 $138.80 |
Softcover ISBN: | 978-0-8218-4351-2 |
Product Code: | CRMP/43 |
List Price: | $118.00 |
MAA Member Price: | $106.20 |
AMS Member Price: | $94.40 |
eBook ISBN: | 978-1-4704-3957-6 |
Product Code: | CRMP/43.E |
List Price: | $111.00 |
MAA Member Price: | $99.90 |
AMS Member Price: | $88.80 |
Softcover ISBN: | 978-0-8218-4351-2 |
eBook ISBN: | 978-1-4704-3957-6 |
Product Code: | CRMP/43.B |
List Price: | $229.00 $173.50 |
MAA Member Price: | $206.10 $156.15 |
AMS Member Price: | $183.20 $138.80 |
-
Book DetailsCRM Proceedings & Lecture NotesVolume: 43; 2007; 335 ppMSC: Primary 11; Secondary 05; 42; 28; 37
One of the most active areas in mathematics today is the rapidly emerging new topic of “additive combinatorics”. Building on Gowers' use of the Freiman–Ruzsa theorem in harmonic analysis (in particular, his proof of Szemerédi's theorem), Green and Tao famously proved that there are arbitrarily long arithmetic progressions of primes, and Bourgain and his co-authors have given non-trivial estimates for hitherto untouchably short exponential sums. There are further important consequences in group theory and in complexity theory and compelling questions in ergodic theory, discrete geometry and many other disciplines. The basis of the subject is not too difficult: it can be best described as the theory of adding together sets of numbers; in particular, understanding the structure of the two original sets if their sum is small. This book brings together key researchers from all of these different areas, sharing their insights in articles meant to inspire mathematicians coming from all sorts of different backgrounds.
Titles in this series are co-published with the Centre de Recherches Mathématiques.
ReadershipUndergraduates, graduate students, and research mathematicians interested in additive combinatorics.
-
Table of Contents
-
Chapters
-
An introduction to additive combinatorics
-
Elementary additive combinatorics
-
Many additive quadruples
-
An old new proof of Roth’s theorem
-
Bounds on exponential sums over small multiplicative subgroups
-
Montréal notes on quadratic Fourier analysis
-
Ergodic methods in additive combinatorics
-
The ergodic and combinatorial approaches to Szemerédi’s theorem
-
Cardinality questions about sumsets
-
Open problems in additive combinatorics
-
Some problems related to sum-product theorems
-
Lattice points on circles, squares in arithmetic progressions and sumsets of squares
-
Problems in additive number theory. I
-
Double and triple sums modulo a prime
-
Additive properties of product sets in fields of prime order
-
Many sets have more sums than differences
-
Davenport’s constant for groups of the form $\mathbb {Z}_3\oplus \mathbb {Z}_3\oplus \mathbb {Z}_{3d}$
-
Some combinatorial group invariants and their generalizations with weights
-
-
RequestsReview Copy – for publishers of book reviewsAccessibility – to request an alternate format of an AMS title
- Book Details
- Table of Contents
- Requests
One of the most active areas in mathematics today is the rapidly emerging new topic of “additive combinatorics”. Building on Gowers' use of the Freiman–Ruzsa theorem in harmonic analysis (in particular, his proof of Szemerédi's theorem), Green and Tao famously proved that there are arbitrarily long arithmetic progressions of primes, and Bourgain and his co-authors have given non-trivial estimates for hitherto untouchably short exponential sums. There are further important consequences in group theory and in complexity theory and compelling questions in ergodic theory, discrete geometry and many other disciplines. The basis of the subject is not too difficult: it can be best described as the theory of adding together sets of numbers; in particular, understanding the structure of the two original sets if their sum is small. This book brings together key researchers from all of these different areas, sharing their insights in articles meant to inspire mathematicians coming from all sorts of different backgrounds.
Titles in this series are co-published with the Centre de Recherches Mathématiques.
Undergraduates, graduate students, and research mathematicians interested in additive combinatorics.
-
Chapters
-
An introduction to additive combinatorics
-
Elementary additive combinatorics
-
Many additive quadruples
-
An old new proof of Roth’s theorem
-
Bounds on exponential sums over small multiplicative subgroups
-
Montréal notes on quadratic Fourier analysis
-
Ergodic methods in additive combinatorics
-
The ergodic and combinatorial approaches to Szemerédi’s theorem
-
Cardinality questions about sumsets
-
Open problems in additive combinatorics
-
Some problems related to sum-product theorems
-
Lattice points on circles, squares in arithmetic progressions and sumsets of squares
-
Problems in additive number theory. I
-
Double and triple sums modulo a prime
-
Additive properties of product sets in fields of prime order
-
Many sets have more sums than differences
-
Davenport’s constant for groups of the form $\mathbb {Z}_3\oplus \mathbb {Z}_3\oplus \mathbb {Z}_{3d}$
-
Some combinatorial group invariants and their generalizations with weights