Related papers: A view on multiple recurrence
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 (which implies Szemer\'edi's Theorem),…
In 1975 Szemer\'edi proved the long-standing conjecture of Erd\H{o}s and Tur\'an that any subset of $\bbZ$ having positive upper Banach density contains arbitrarily long arithmetic progressions. Szemer\'edi's proof was entirely…
The Furstenberg recurrence theorem (or equivalently, Szemer\'edi's theorem) can be formulated in the language of von Neumann algebras as follows: given an integer $k \geq 2$, an abelian finite von Neumann algebra $(\M,\tau)$ with an…
A major theme in arithmetic combinatorics is proving multiple recurrence results on semigroups (such as Szemer\'edi's theorem) and this can often be done using methods of ergodic Ramsey theory. What usually lies at the heart of such proofs…
We present a short proof of Szemer\'edi's Theorem using a dynamical system enriched by ideas from model theory. The resulting proof contains features reminiscent of proofs based on both ergodic theory and on hypergraph regularity.
We establish results with an arithmetic flavor that generalize the polynomial multidimensional Szemeredi theorem and related multiple recurrence and convergence results in ergodic theory. For instance, we show that in all these statements…
The principal results proved in this expository thesis are the IP polynomial Szemer\'edi theorem for nilpotent groups and the multiple term return times theorem with nilsequence weights. It also contains extensions of the convergence…
We examine multiple ergodic averages of commuting transformations with polynomial iterates in which the polynomials may be pairwise dependent. In particular, we show that such averages are controlled by the Gowers-Host-Kra seminorms…
We investigate how spectral properties of a measure preserving system $(X,\mathcal{B},\mu,T)$ are reflected in the multiple ergodic averages arising from that system. For certain sequences $a:\mathbb{N}\to\mathbb{N}$ we provide natural…
A famous theorem of Szemer\'edi asserts that given any density $0 < \delta \leq 1$ and any integer $k \geq 3$, any set of integers with density $\delta$ will contain infinitely many proper arithmetic progressions of length $k$. For general…
Motivated by studying stochastic systems with non-Gaussian L\'evy noise, spectral properties for a type of linear cocycles are considered. These linear cocycles have countable jump discontinuities in time. A multiplicative ergodic theorem…
We provide various counter examples for quantitative multiple recurrence problems for systems with more than one transformation. We show that $\bullet$ There exists an ergodic system $(X,\mathcal{X},\mu,T_1,T_2)$ with two commuting…
We consider mutually disjoint family of measure preserving transformations $T_1, \cdots, T_k$ on a probability space $(X, \mathcal{B}, \mu)$. We obtain the multiple recurrence property of $T_1, \cdots, T_k$ and this result is utilized to…
A collection of integer sequences is jointly ergodic if for every ergodic measure preserving system the multiple ergodic averages, with iterates given by this collection of sequences, converge in the mean to the product of the integrals. We…
We give necessary and sufficient conditions for joint ergodicity results of collections of sequences with respect to systems of commuting measure preserving transformations. Combining these results with a new technique that we call…
Using a structure theorem from [FG2010] we prove a version of multiple recurrence for sets of positive measure in a general stationary dynamical system.
We show the $L^2$-convergence of continuous time ergodic averages of a product of functions evaluated at return times along polynomials. These averages are the continuous time version of the averages appearing in Furstenberg's proof of…
A famous theorem of Szemer\'edi asserts that any set of integers of positive upper density will contain arbitrarily long arithmetic progressions. In its full generality, we know of four types of arguments that can prove this theorem: the…
For every $k\in \mathbb{N}$, we produce a set of integers which is $k$-recurrent but not $(k+1)$-recurrent. This extends a result of Furstenberg who produced a 1-recurrent set which is not 2-recurrent. We discuss a similar result for…
We present a unified approach to extensions of Bourgain's Double Recurrence Theorem and Bourgain's Return Times Theorem to integer parts of the Kronecker sequence, emphasizing stopping times and metric entropy. Specifically, we prove the…