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

DOI10.1007/S11854-018-0037-8zbMATH Open1442.11026arXiv1509.04485OpenAlexW2962729391MaRDI QIDQ1661514FDOQ1661514

Authors: Pablo Candela, Balázs Szegedy 

Publication date: 16 August 2018

Published in: Journal d'Analyse Mathématique (Search for Journal in Brave)

Abstract: It is known that if $p$ is a sufficiently large prime then for every function $f:mathbb{Z}_{p}o[0,1]$ there exists a continuous function on the circle $f^{\prime }:mathbbTo[0,1]$ such that the averages of $f$ and $f^{\prime }$ across any prescribed system of linear forms of complexity 1 differ by at most $epsilon$. 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 $mathbbT$ with the torus $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 $mathbb{Z}_p$. For instance, let $m_4(alpha,mathbb{Z}_p)$ denote the minimum, over all sets $Asubsetmathbb{Z}_p$ of cardinality at least $alphap$, of the density of 4-term arithmetic progressions inside $A$. We show that $li{m}_{poinfty}{m}_4(alpha,mathbb{Z}_p)$ is equal to the infimum, over all measurable functions $f:mathbb{T}^{2}o[0,1]$ with $in{t}_{mathbb{T}^2}fgeqalpha$, of the following integral: ${\displaystyle }$ int_{mathbb{T}^5} f�inom{x_1}{y_1}; f�inom{x_1+x_2}{y_1+y_2}; f�inom{x_1+2x_2}{y_1+2y_2+y_3}; f�inom{x_1+3 x_2}{y_1+3y_2+3y_3} ,dmu_{mathbb{T}^5}(x_1,x_2,y_1,y_2,y_3). ${\displaystyle }$

Full work available at URL: https://arxiv.org/abs/1509.04485

Recommendations

• Systems theory over finitely generated Abelian groups
• scientific article; zbMATH DE number 3983493
• On some measures of complexity of finite abelian groups
• Maximal computational complexity of systems of elements of free Abelian group
• The complexity of some reachability problems for a system on a finite group
• Complexity and elementary Abelian p-groups
• On the computational complexity of the theory of Abelian groups
• On complexes in a finite Abelian group. II
• Descriptive complexity of finite abelian groups

zbMATH Keywords

simple abelian groupssystems of complexity 2

Mathematics Subject Classification ID

Arithmetic combinatorics; higher degree uniformity (11B30) Extremal combinatorics (05D99)

Cites Work

• Limits of dense graph sequences
• Additive combinatorics
• Title not available (Why is that?)
• Sur les groupes nilpotents et les anneaux de Lie
• A new proof of Szemerédi's theorem
• An arithmetic regularity lemma, an associated counting lemma, and applications
• The quantitative behaviour of polynomial orbits on nilmanifolds
• Title not available (Why is that?)
• The true complexity of a system of linear equations
• Principles of harmonic analysis
• An inverse theorem for the Gowers \(U^{s+1}[N]\)-norm
• On the asymptotic maximal density of a set avoiding solutions to linear equations modulo a prime
• Linear forms and quadratic uniformity for functions on \(\mathbb{Z}_{N}\)
• Large values of the Gowers-Host-Kra seminorms
• Orbit of the diagonal in the power of a nilmanifold
• The Minimal Number of Three-Term Arithmetic Progressions Modulo a Prime Converges to a Limit
• Polynomial sequences in groups
• Quadratic uniformity of the Möbius function
• Open problems in additive combinatorics
• Symplectic spaces and ear-decomposition of matroids
• Convergence results for systems of linear forms on cyclic groups and periodic nilsequences

This page was built for publication: A continuous model for systems of complexity 2 on simple abelian groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1661514)