English

An uncountable ergodic Roth theorem and applications

Dynamical Systems 2023-11-13 v6 Combinatorics

Abstract

We establish an uncountable amenable ergodic Roth theorem, in which the acting group is not assumed to be countable and the space need not be separable. This generalizes a previous result of Bergelson, McCutcheon and Zhang, and complements a result of Zorin-Kranich. We establish the following two additional results: First, a combinatorial application about triangular patterns in certain subsets of the Cartesian square of arbitrary amenable groups, extending a result of Bergelson, McCutcheon and Zhang for countable amenable groups. Second, a new uniformity aspect in the double recurrence theorem for Γ\Gamma-systems for arbitrary uniformly amenable groups Γ\Gamma. Our uncountable Roth theorem is crucial in the proof of both of these results.

Keywords

Cite

@article{arxiv.2101.00685,
  title  = {An uncountable ergodic Roth theorem and applications},
  author = {Polona Durcik and Rachel Greenfeld and Annina Iseli and Asgar Jamneshan and José Madrid},
  journal= {arXiv preprint arXiv:2101.00685},
  year   = {2023}
}

Comments

35 pages, final version, accepted for publication in DCDS-A

R2 v1 2026-06-23T21:43:42.729Z