Lower bound in the Roth theorem for amenable groups
Dynamical Systems
2015-08-05 v2 Combinatorics
Abstract
Let , be two commuting probability measure-preserving actions of a countable amenable group such that the group spanned by these actions acts ergodically. We show that on a syndetic set for any measurable set and any . The proof uses the concept of a sated system introduced by Austin.
Cite
@article{arxiv.1309.6095,
title = {Lower bound in the Roth theorem for amenable groups},
author = {Qing Chu and Pavel Zorin-Kranich},
journal= {arXiv preprint arXiv:1309.6095},
year = {2015}
}
Comments
v2: added a counterexample showing that the exponent in the main result cannot be improved to 3. To appear in Ergodic Theory and Dynamical Systems