A continuous model for systems of complexity 2 on simple abelian groups
Pablo Candela, Bal\'azs Szegedy

TL;DR
This paper extends the continuous modeling of functions from prime cyclic groups to the torus for systems of complexity 2, using quadratic Fourier analysis and filtered nilmanifolds, to analyze combinatorial structures like arithmetic progressions.
Contribution
It generalizes previous results from complexity 1 to complexity 2, introducing a new framework using filtered nilmanifolds and quadratic Fourier analysis for continuous models.
Findings
Established a limit expression for 4-term arithmetic progressions on lgebras of complexity 2
Developed a notion of modeling for filtered nilmanifolds based on equidistributed maps
Connected combinatorial quantities on lgebras to integrals over lgebras of complexity 2.
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 .…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
