Ergodic Methods in Additive Combinatorics

@article{Kra2006ErgodicMI,
  title={Ergodic Methods in Additive Combinatorics},
  author={Bryna Kra},
  journal={arXiv: Dynamical Systems},
  year={2006},
  pages={103-143}
}
  • Bryna Kra
  • Published 3 August 2006
  • Mathematics
  • arXiv: Dynamical Systems
Shortly after Szemer\'edi's proof that a set of positive upper density contains arbitrarily long arithmetic progressions, Furstenberg gave a new proof of this theorem using ergodic theory. This gave rise to the field of ergodic Ramsey Theory, in which problems motivated by additive combinatorics are proven using ergodic theory. Ergodic Ramsey Theory has since produced combinatorial results, some of which have yet to be obtained by other means, and has also given a deeper understanding of the… 

Figures from this paper

Poincaré recurrence and number theory: thirty years later
Hillel Furstenberg’s 1981 article in the Bulletin gives an elegant introduction to the interplay between dynamics and number theory, summarizing the major developments that occurred in the few years
Additive Combinatorics: With a View Towards Computer Science and Cryptography - An Exposition
TLDR
This exposition attempts to provide an overview of some breakthroughs in this field, together with a number of seminal applications to sundry parts of mathematics and some other disciplines, with emphasis on computer science and cryptography.
Ergodic-theoretic implementations of the Roth density-increment argument
We exhibit proofs of two ergodic-theoretic results in the study of multiple recurrence using an analog of the density-increment argument of Roth and Gowers: Furstenberg's Multiple Recurrence Theorem
Higher Order Fourier Analysis
Traditional Fourier analysis, which has been remarkably effective in many contexts, uses linear phase functions to study functions. Some questions, such as problems involving arithmetic progressions,
A multidimensional Szemerédi's theorem in the primes
Let $A$ be a subset of positive relative upper density of $\PP^d$, the $d$-tuples of primes. We prove that $A$ contains an affine copy of any finite set $F\subs\Z^d$, which provides a natural
Some open problems on multiple ergodic averages
1. Extended bibliography organized by topic Below we give a rather extensive bibliography with material that is directly related to the problems discussed before, organized by topic. We caution the
A dynamical proof of the van der Corput inequality
We provide a dynamical proof of the van der Corput inequality for sequences in Hilbert spaces that is based on the Furstenberg correspondence principle. This is done by reducing the inequality to the
The true complexity of a system of linear equations
In this paper we look for conditions that are sufficient to guarantee that a subset A of a finite Abelian group G contains the ‘expected’ number of linear configurations of a given type. The simplest
On the limit of square-Cesàro means of contractions on Hilbert spaces
By combining tools from functional analysis and algebraic number theory, we investigate the qualitative properties of the square-Cesàro means $${{\frac{1}{N}}\sum_{n=1}^N T^{n^2}}$$, where T is a
...
...

References

SHOWING 1-10 OF 85 REFERENCES
Ergodic Ramsey Theory–an Update
Our achievements on the theoretical front will be very poor indeed if...we close our eyes to problems and can only memorize isolated conclusions or principles... A mathematical discipline is alive
The Green-Tao Theorem on arithmetic progressions in the primes: an ergodic point of view
A long standing and almost folkloric conjecture is that the primes contain arbitrarily long arithmetic progressions. Until recently, the only progress on this conjecture was due to van der Corput,
From combinatorics to ergodic theory and back again
Multiple ergodic averages, such as the average of expressions like f1(T nx) f2(T 2nx) . . . fk(T knx), were first studied in the ergodic theoretic proof of Szemeredi�s Theorem on arithmetic
Ergodic Averages for Independent Polynomials and Applications
Szemerédi's theorem states that a set of integers with positive upper density contains arbitrarily long arithmetic progressions. Bergelson and Leibman generalized this, showing that sets of integers
Strict Ergodicity and Transformation of the Torus
Introduction. If T is a measure preserving transformation ofl a probability space Q with measure Iu, the ergodic theorem assures the existence N-1 almost everywhere with respect to /i of the average
An ergodic Szemerédi theorem for commuting transformations
The classical Poincar6 recurrence theorem asserts that under the action of a measure preserving transformation T of a finite measure space (X, ~, p.), every set A of positive measure recurs in the
The ergodic theoretical proof of Szemerédi's theorem
Partial results were obtained previously by K. F. Roth (1952) who established the existence of arithmetic progressions of length three in subsets of Z of positive upper density, and by E. Szemeredi
What is ergodic theory
Ergodic theory involves the study of transformations on measure spaces. Interchanging the words “measurable function” and “probability density function” translates many results from real analysis to
On sets of integers containing k elements in arithmetic progression
In 1926 van der Waerden [13] proved the following startling theorem : If the set of integers is arbitrarily partitioned into two classes then at least one class contains arbitrarily long arithmetic
A new proof of Szemerédi's theorem
In 1927 van der Waerden published his celebrated theorem on arithmetic progressions, which states that if the positive integers are partitioned into finitely many classes, then at least one of these
...
...