A cone restriction estimate using polynomial partitioning (Q2148896)

From MaRDI portal
Revision as of 09:00, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A cone restriction estimate using polynomial partitioning
scientific article

    Statements

    A cone restriction estimate using polynomial partitioning (English)
    0 references
    0 references
    0 references
    24 June 2022
    0 references
    Summary: We obtain an improved Fourier restriction estimate for a truncated cone using the method of polynomial partitioning in dimension \(n\geq 3\), which in particular solves the cone restriction conjecture for \(n=5\), and recovers the sharp range for \(3\leq n\leq 4\). The main ingredient of the proof is a \(k\)-broad estimate for the cone extension operator, which is a weak version of the \(k\)-linear cone restriction conjecture for \(2\leq k\leq n\).
    0 references
    restriction estimate
    0 references
    polynomial method
    0 references

    Identifiers