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

DOI10.1007/S11854-018-0037-8MaRDI QIDQ1661514zbMATH OpenOpenAlexFDO

Authors Pablo Candela, Balázs Szegedy

Publication date 16 August 2018

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

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

zbMATH Keywords

simple abelian groupssystems of complexity 2

Mathematics Subject Classification ID

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

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 }$

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

Cites work

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

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)