Convergence results for systems of linear forms on cyclic groups and periodic nilsequences

DOI10.1137/130935677MaRDI QIDQ3192164zbMATH OpenOpenAlexFDO

Authors Pablo Candela, Olof Sisask

Publication date 26 September 2014

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

linear configurationsnilsequenceshigher-order Fourier analysis

Mathematics Subject Classification ID

Arithmetic combinatorics; higher degree uniformity (11B30) Fourier and Fourier-Stieltjes transforms on locally compact and other abelian groups (43A25)

Abstract: Given a positive integer $N$ and real number $alphain[0,1]$, let $m(alpha,N)$ denote the minimum, over all sets $AsubsetmathbbZ/NmathbbZ$ of size at least $alphaN$, of the normalized count of 3-term arithmetic progressions contained in $A$. A theorem of Croot states that $m(alpha,N)$ converges as $Noinfty$ through the primes, answering a question of Green. Using recent advances in higher-order Fourier analysis, we prove an extension of this theorem, showing that the result holds for $k$-term progressions for general $k$ and further for all systems of integer linear forms of finite complexity. We also obtain a similar convergence result for the maximum densities of sets free of solutions to systems of linear equations. These results rely on a regularity method for functions on finite cyclic groups that we frame in terms of periodic nilsequences, using in particular some regularity results of Szegedy (relying on his joint work with Camarena) and equidistribution results of Green and Tao.

Recommendations

• The true complexity of a system of linear equations
• Linear forms and higher-degree uniformity for functions on \(\mathbb F^n_p\)
• General systems of linear forms: equidistribution and true complexity
• Higher-order Fourier analysis of \(\mathbb F_p^n\) and the complexity of systems of linear forms
• On the asymptotic maximal density of a set avoiding solutions to linear equations modulo a prime

Cited in

(7)

• On several notions of complexity of polynomial progressions
• The true complexity of a system of linear equations
• Equidistribution for nilsequences along spheres over finite fields
• A continuous model for systems of complexity 2 on simple abelian groups
• Regularity and inverse theorems for uniformity norms on compact abelian groups and nilmanifolds
• True complexity of polynomial progressions in finite fields
• Limits of functions on groups

This page was built for publication: Convergence results for systems of linear forms on cyclic groups and periodic nilsequences

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