Title
General systems of linear forms: Equidistribution and true complexity
Abstract
Higher-order Fourier analysis is a powerful tool that can be used to analyze the densities of linear systems (such as arithmetic progressions) in subsets of Abelian groups. We are interested in the group Fpn, for fixed p and large n, where it is known that analyzing these averages reduces to understanding the joint distribution of a family of sufficiently pseudorandom (formally, high-rank) nonclassical polynomials applied to the corresponding system of linear forms.
Year
DOI
Venue
2014
10.1016/j.aim.2016.01.019
Advances in Mathematics
Keywords
DocType
Volume
Higher-order Fourier analysis,Additive combinatorics,Linear patterns,Nonclassical polynomials
Journal
292
ISSN
Citations 
PageRank 
0001-8708
0
0.34
References 
Authors
0
3
Name
Order
Citations
PageRank
Hamed Hatami121623.09
Pooya Hatami29414.40
Shachar Lovett352055.02