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

preprint2016arXivOpen access

Abstract

It is known that if pp is a sufficiently large prime then for every function f:Zp→[0,1]f:\mathbb{Z}_p\to [0,1] there exists a continuous function on the circle f′:T→[0,1]f':\mathbb{T}\to [0,1] such that the averages of ff and f′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\mathbb{T} with the torus T2\mathbb{T}^2 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\mathbb{Z}_p. For instance, let m4(α,Zp)m_4(α,\mathbb{Z}_p) denote the minimum, over all sets A⊂ZpA\subset \mathbb{Z}_p of cardinality at least αpαp, of the density of 4-term arithmetic progressions inside AA. We show that lim⁡p→∞m4(α,Zp)\lim_{p\to \infty} m_4(α,\mathbb{Z}_p) is equal to the infimum, over all measurable functions f:T2→[0,1]f:\mathbb{T}^2\to [0,1] with ∫T2f≥α\int_{\mathbb{T}^2}f\geq α, of the following integral: ∫T5f(x1y1)  f(x1+x2y1+y2)  f(x1+2x2y1+2y2+y3)  f(x1+3x2y1+3y2+3y3) dμT5(x1,x2,y1,y2,y3). \int_{\mathbb{T}^5} f\binom{x_1}{y_1}\; f\binom{x_1+x_2}{y_1+y_2}\; f\binom{x_1+2x_2}{y_1+2y_2+y_3}\; f\binom{x_1+3 x_2}{y_1+3y_2+3y_3} \,dμ_{\mathbb{T}^5}(x_1,x_2,y_1,y_2,y_3).

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.