A continuous model for systems of complexity 2 on simple abelian groups
Abstract
It is known that if is a sufficiently large prime then for every function there exists a continuous function on the circle such that the averages of and across any prescribed system of linear forms of complexity 1 differ by at most . This result follows from work of Sisask, building on Fourier-analytic arguments of Croot that answered a question of Green. We generalize this result to systems of complexity at most 2, replacing with the torus equipped with a specific filtration. To this end we use a notion of modelling for filtered nilmanifolds, that we define in terms of equidistributed maps, and we combine this with tools of quadratic Fourier analysis. Our results yield expressions on the torus for limits of combinatorial quantities involving systems of complexity 2 on . For instance, let denote the minimum, over all sets of cardinality at least , of the density of 4-term arithmetic progressions inside . We show that is equal to the infimum, over all measurable functions with , of the following integral:
Cite
@article{arxiv.1509.04485,
title = {A continuous model for systems of complexity 2 on simple abelian groups},
author = {Pablo Candela and Balázs Szegedy},
journal= {arXiv preprint arXiv:1509.04485},
year = {2016}
}
Comments
32 pages. Referee's comments incorporated, yielding improvements in the exposition in sections 2.1, 5, and 6. To appear in Journal d'Analyse Math\'ematique