An inverse theorem for the Gowers \(U^{s+1}[N]\)-norm

DOI10.3934/era.2011.18.69zbMath1247.11017OpenAlexW2963404131WikidataQ61645413 ScholiaQ61645413MaRDI QIDQ5892620

Terence C. Tao, Ben Green, Tamar Ziegler

Publication date: 14 July 2011

Published in: Electronic Research Announcements in Mathematical Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/era.2011.18.69

zbMATH Keywords

nilsequencesGowers normsHardy-Littlewood prime tuples conjectureasymptotic formula for the number of \(k\)-term arithmetic progressionslinear system of finite complexity

Mathematics Subject Classification ID

Distribution of primes (11N05) Arithmetic combinatorics; higher degree uniformity (11B30)

Related Items (3)

Large values of the Gowers-Host-Kra seminorms ⋮ An inverse theorem for the Gowers \(U^{s+1}[N\)-norm] ⋮ Finite field models in arithmetic combinatorics -- ten years on

This page was built for publication: An inverse theorem for the Gowers \(U^{s+1}[N]\)-norm