A continuous model for systems of complexity 2 on simple abelian groups

Abstract

It is known that if p is a sufficiently large prime then for every function f:Zp [0,1] there exists a continuous function on the circle f':T [0,1] such that the averages of f and f' 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 T with the torus T2 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 Zp. For instance, let m4(α,Zp) denote the minimum, over all sets A⊂ Zp of cardinality at least α p, of the density of 4-term arithmetic progressions inside A. We show that p ∞ m4(α,Zp) is equal to the infimum, over all measurable functions f:T2 [0,1] with ∫T2f≥ α, of the following integral: ∫T5 fx1y1\; fx1+x2y1+y2\; fx1+2x2y1+2y2+y3\; fx1+3 x2y1+3y2+3y3 \,dμT5(x1,x2,y1,y2,y3).

0

Discussion (0)

Sign in to join the discussion.

Loading comments…