General systems of linear forms: equidistribution and true complexity
From MaRDI portal
Publication:5965073
DOI10.1016/j.aim.2016.01.019zbMath1336.11014arXiv1403.7703OpenAlexW2964103776MaRDI QIDQ5965073
Pooya Hatami, Shachar Lovett, Hamed Hatami
Publication date: 2 March 2016
Published in: Advances in Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1403.7703
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (6)
Induced arithmetic removal: complexity 1 patterns over finite fields ⋮ Stability and exact Turán numbers for matroids ⋮ Testing Linear-Invariant Properties ⋮ A refinement of Cauchy-Schwarz complexity ⋮ A counting lemma for binary matroids and applications to extremal problems ⋮ Good Bounds in Certain Systems of True Complexity One
Cites Work
- Unnamed Item
- Unnamed Item
- The inverse conjecture for the Gowers norm over finite fields in low characteristic
- Linear forms and higher-degree uniformity for functions on \(\mathbb F^n_p\)
- The inverse conjecture for the Gowers norm over finite fields via the correspondence principle
- Higher-order Fourier analysis of \(\mathbb F_p^n\) and the complexity of systems of linear forms
- Linear equations in primes
- An inverse theorem for the uniformity seminorms associated with the action of \(\mathbb F_p^\infty\)
- An arithmetic regularity lemma, associated counting lemma, and applications
- The distribution of polynomials over finite fields, with applications to the Gowers norms
- Decompositions, approximate structure, transference, and the Hahn-Banach theorem
- Every locally characterized affine-invariant property is testable
- Testing Low Complexity Affine-Invariant Properties
- The true complexity of a system of linear equations
- An inverse theorem for the Gowers \(U^{s+1}[N\)-norm]
- A new proof of Szemerédi's theorem
This page was built for publication: General systems of linear forms: equidistribution and true complexity
