Weighted averages and applications to sets of multiple recurrence

Abstract

We introduce new techniques for determining combinatorial properties of sets of multiple recurrence by considering weighted averages with quickly growing weights. Our main result is a far-reaching generalization of Szemerédi's Theorem which additionally confirms a conjecture of Bergelson-Moreira-Richter and contains as special cases both the Polynomial Szemerédi Theorem due to Bergelson-Leibman-Lesigne and the fact that if f belongs to a broad class of smooth functions and satisfies x^d−1≺ f(x)≺ x^d for some d∈ ℕ then for any ℓ∈ ℕ, any invertible measure preserving system (X,ℬ,μ,T), and any A∈ ℬ with μ(A)>0, the set {n∈ ℕ: μ(A∩ T^−[f(n)]A∩ T^−2[f(n)]A∩ ⋯∩ T^−ℓ[f(n)]A )>0} is thick, meaning that it contains arbitrarily long intervals of natural numbers. Additionally, we formulate and prove a generalization to weighted averages of Boshernitzan's criterion for uniform distribution which we use in the proof of our main result.

Weighted ergodic averages along subpolynomials in Hardy fields and applications
Vitaly Bergelson, Sovanlal Mondal, Younghwan Son
arXiv14 Sep 2026PreprintarXiv licenceFull textDynamical systemsarXiv
Product sets in sets of returns and positivity of symmetric ergodic averages
Vitaly Bergelson, Saúl Rodríguez-Martín
arXiv4 Nov 2026PreprintarXiv licenceFull textAlgebra & number theory Combinatorics & discrete mathematicsarXiv
Optimal rates of uniform convergence for weighted Birkhoff averages via almost all rotations
Zhicheng Tong, Yong Li
arXiv22 Sep 2026PreprintarXiv licenceFull textDynamical systemsarXiv
Linearized Certificates and Normality-Gated Registrations for Weighted Generator Averages
WuJun Chen
Zenodo (CERN European Organization for Nuclear Research)3 Jul 2026PreprintCC BY5 citedCombinatorics & discrete mathematicsOpenAlex
Multiple ergodic averages for commuting multiplicative actions
Dimitrios Charamaras, Andreas Koutsogiannis, Konstantinos Tsinas
arXiv1 Sep 2026PreprintCC BY 4.0Full textDynamical systemsarXiv

Cite

BibTeX RIS

BibTeX

@misc{bergelson2026weighted,
  title = {{Weighted averages and applications to sets of multiple recurrence}},
  author = {Vitaly Bergelson and Michael Reilly},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.16554},
  eprint = {2609.16554},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.16554},
  note = {CC BY 4.0},
}

RIS

TY  - UNPB
TI  - Weighted averages and applications to sets of multiple recurrence
AU  - Vitaly Bergelson
AU  - Michael Reilly
PY  - 2026
DA  - 2026/09/15
PB  - arXiv
DO  - 10.48550/arxiv.2609.16554
UR  - https://arxiv.org/abs/2609.16554
AB  - We introduce new techniques for determining combinatorial properties of sets of multiple recurrence by considering weighted averages with quickly growing weights. Our main result is a far-reaching generalization of Szemerédi's Theorem which additionally confirms a conjecture of Bergelson-Moreira-Richter and contains as special cases both the Polynomial Szemerédi Theorem due to Bergelson-Leibman-Lesigne and the fact that if f belongs to a broad class of smooth functions and satisfies x^d−1≺ f(x)≺ x^d for some d∈ ℕ then for any ℓ∈ ℕ, any invertible measure preserving system (X,ℬ,μ,T), and any A∈ ℬ with μ(A)>0, the set {n∈ ℕ: μ(A∩ T^−[f(n)]A∩ T^−2[f(n)]A∩ ⋯∩ T^−ℓ[f(n)]A )>0} is thick, meaning that it contains arbitrarily long intervals of natural numbers. Additionally, we formulate and prove a generalization to weighted averages of Boshernitzan's criterion for uniform distribution which we use in the proof of our main result.
ER  -

Abstract

Related

Cite