General systems of linear forms: equidistribution and true complexity (Q5965073)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: General systems of linear forms: equidistribution and true complexity |
scientific article; zbMATH DE number 6548171
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | General systems of linear forms: equidistribution and true complexity |
scientific article; zbMATH DE number 6548171 |
Statements
General systems of linear forms: equidistribution and true complexity (English)
0 references
2 March 2016
0 references
higher-order Fourier analysis
0 references
additive combinatorics
0 references
linear patterns
0 references
nonclassical polynomials
0 references
0 references
0 references
0 references
0 references
The paper is a continuation of the authors' previous paper [\textit{A. Bhattacharyya} et al., in: Proceedings of the 45th annual ACM symposium on theory of computing, STOC 2013. Palo Alto, CA, USA, June 1--4, 2013. New York, NY: ACM, 429--436 (2013; Zbl 1293.11016)]. The density of a linear system in subsets of Abelian groups is analysed by high-order Fourier analysis.NEWLINENEWLINEA complete characterization for a special type of distributions for arbitrary systems of linear forms is given.NEWLINENEWLINESome interesting applications are discussed, one of which -- an idea for a new theory of homogeneous non-classical polynomials.
0 references
0.8450571894645691
0 references
0.8027752041816711
0 references
0.7934832572937012
0 references
0.7495574355125427
0 references
0.7397798299789429
0 references
