English
Related papers

Related papers: Ergodic Averages for Independent Polynomials and A…

200 papers

We prove a far-reaching strengthening of Szemer\'edi's regularity lemma for intersection graphs of pseudo-segments. It shows that the vertex set of such a graph can be partitioned into a bounded number of parts of roughly the same size such…

Combinatorics · Mathematics 2023-12-05 Jacob Fox , Janos Pach , Andrew Suk

We offer a new proof of the Furstenberg-Katznelson multiple recurrence theorem for several commuting probability-preserving transformations T_1, T_2, >..., T_d: \bbZ\curvearrowright (X,\S,\mu), and so, via the Furstenberg correspondence…

Dynamical Systems · Mathematics 2009-03-09 Tim Austin

We study properties of arithmetic sets coming from multiplicative number theory and obtain applications in the theory of uniform distribution and ergodic theory. Our main theorem is a generalization of K\'atai's orthogonality criterion.…

Number Theory · Mathematics 2022-05-16 V. Bergelson , J. Kułaga-Przymus , M. Lemańczyk , F. K. Richter

A distributional symmetry is invariance of a distribution under a group of transformations. Exchangeability and stationarity are examples. We explain that a result of ergodic theory provides a law of large numbers: If the group satisfies…

Statistics Theory · Mathematics 2021-11-30 Morgane Austern , Peter Orbanz

We establish two ergodic theorems which have among their corollaries numerous classical results from multiplicative number theory, including the Prime Number Theorem, a theorem of Pillai-Selberg, a theorem of Erd\H{o}s-Delange, the mean…

Dynamical Systems · Mathematics 2023-12-19 Vitaly Bergelson , Florian K. Richter

In this paper we study multiple ergodic averages for "good" variable polynomials. In particular, under an additional assumption, we show that these averages converge to the expected limit, making progress related to an open problem posted…

Dynamical Systems · Mathematics 2022-07-19 Andreas Koutsogiannis

Green, Tao and Ziegler prove ``Dense Model Theorems'' of the following form: if R is a (possibly very sparse) pseudorandom subset of set X, and D is a dense subset of R, then D may be modeled by a set M whose density inside X is…

Combinatorics · Mathematics 2008-06-04 Omer Reingold , Luca Trevisan , Madhur Tulsiani , Salil Vadhan

Given a set of $n$ points in $R^2$, the Szemer\'edi-Trotter theorem establishes that the number of lines which can be incident to at least $k > 1$ of these points is $O(n^2/k^3 + n/k)$. J.\ Solymosi conjectured that if one requires the…

Combinatorics · Mathematics 2014-07-31 G. Amirkhanyan , A. Bush , E. Croot , C. Pryby

Let G be a finite graph with the non-k-order property (essentially, a uniform finite bound on the size of an induced sub-half-graph). A major result of the paper applies model-theoretic arguments to obtain a stronger version of…

Logic · Mathematics 2015-08-20 M. Malliaris , S. Shelah

We establish a polynomial ergodic theorem for actions of the affine group of a countable field $K$. As an application, we deduce--via a variant of Furstenberg's correspondence principle--that for fields of characteristic zero, any "large"…

Combinatorics · Mathematics 2026-01-14 Ioannis Kousek

We provide a representation in terms of certain canonical functions for a sequence of polynomials orthogonal with respect to a weight that is strictly positive and analytic on the unit circle. These formulas yield a complete asymptotic…

Classical Analysis and ODEs · Mathematics 2007-05-23 A. Martinez-Finkelshtein , K. T. -R. McLaughlin , E. B. Saff

We establish an abstract local ergodic theorem, under suitable space-time scaling, for the (boundary-driven) symmetric exclusion process on an increasing sequence of balls covering an infinite weighted graph. The proofs are based on 1-block…

Probability · Mathematics 2017-08-25 Joe P. Chen

We prove ergodicity for random dynamics satisfying some expansion and irreducibility conditions. As a particular application, we show that if $R_1,R_2\in \mathrm{SO}(d+1)$, $d\ge 2$, generate a dense subgroup, then the random dynamics of…

Dynamical Systems · Mathematics 2026-05-21 Jonathan DeWitt , Dmitry Dolgopyat , Zhiyuan Zhang

A celebrated result of Gowers states that for every \epsilon > 0 there is a graph G so that every \epsilon-regular partition of G (in the sense of Szemeredi's regularity lemma) has order given by a tower of exponents of height polynomial in…

Combinatorics · Mathematics 2013-08-27 Guy Moshkovitz , Asaf Shapira

We prove several results related to the theorem of Logvinenko and Sereda on determining sets for functions with Fourier transforms supported in an interval. We obtain a polynomial instead of exponential bound in this theorem, and we extend…

Classical Analysis and ODEs · Mathematics 2007-05-23 Oleg Kovrizhkin

The study of many problems in additive combinatorics, such as Szemer\'edi's theorem on arithmetic progressions, is made easier by first studying models for the problem in F_p^n for some fixed small prime p. We give a number of examples of…

Number Theory · Mathematics 2007-05-23 Ben Green

We consider pointwise convergence of weighted ergodic averages along the sequence $\Omega(n)$, where $\Omega(n)$ denotes the number of prime factors of $n$ counted with multiplicities. It was previously shown that $\Omega(n)$ satisfies the…

Dynamical Systems · Mathematics 2024-10-15 Kaitlyn Loyd , Sovanlal Mondal

We provide an elementary proof of Y. Peres' lemma on the existence in certain dynamical systems of what we term heavy points, points whose ergodic averages consistently dominate the expected value of the ergodic averages. We also derive…

Dynamical Systems · Mathematics 2009-06-23 David Ralston

This article shortly provides related proofs of the ergodic theorems of von Neumann, Birkhoff, Wiener, and Rokhlin's lemma for $Z^d$-actions with an invariant measure. It is shown how some deviations of ergodic averages can be structured.…

Dynamical Systems · Mathematics 2026-05-29 Valery V. Ryzhikov

Let $f_{s,k}(n)$ be the maximum possible number of $s$-term arithmetic progressions in a sequence $a_1<a_2<\ldots<a_n$ of $n$ integers which contains no $k$-term arithmetic progression. For all integers $k > s \geq 3$, we prove that…

Combinatorics · Mathematics 2020-08-10 Jacob Fox , Cosmin Pohoata