Functions of nearly maximal Gowers-Host-Kra norms on Euclidean spaces
Abstract
Let k≥ 2, n≥ 1 be integers. Let f: Rn C. The kth Gowers-Host-Kra norm of f is defined recursively by equation* \| f\|Uk2k =∫Rn \| Thf · f \|Uk-12k-1 \, dh equation* with Thf(x) = f(x+h) and \|f\|U1 = | ∫Rn f(x)\, dx |. These norms were introduced by Gowers in his work on Szemer\'edi's theorem, and by Host-Kra in ergodic setting. It's shown by Eisner and Tao that for every k≥ 2 there exist A(k,n)< ∞ and pk = 2k/(k+1) such that \| f\|Uk ≤ A(k,n)\|f\|pk, for all f ∈ Lpk(Rn). The optimal constant A(k,n) and the extremizers for this inequality are known. In this exposition, it is shown that if the ratio \| f \|Uk/\|f\|pk is nearly maximal, then f is close in Lpk norm to an extremizer.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.