Additive combinatorics / Andrew Granville, Melvyn B. Nathanson, Jozsef Solymosi, editors.

Format:

Book

Conference/Event

Contributor:

Solymosi, József, editor.

Nathanson, Melvyn B., editor.

Andrew Granville,, editor.

Conference Name:

CRM--Clay School on Additive Combinatorics (2006 : Université de Montréal)

Series:

CRM proceedings & lecture notes ; Volume 43.

CRM Proceedings & Lecture Notes, 1065-8580 ; Volume 43

Language:

English

Subjects (All):

Additive combinatorics--Congresses.

Additive combinatorics.

Combinatorial analysis--Congresses.

Combinatorial analysis.

Physical Description:

1 online resource (345 pages) : illustrations.

Place of Publication:

Providence, Rhode Island : American Mathematical Society, 2007.

Summary:

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 Szemeredi'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.

Notes:

Includes bibliographical references.

Description based on print version record.

ISBN:

1-4704-3957-3