Mathematics > Classical Analysis and ODEs
[Submitted on 26 May 2018 (v1), last revised 24 Aug 2020 (this version, v3)]
Title:An $l^2$ decoupling interpretation of efficient congruencing: the parabola
View PDFAbstract:We give a new proof of $l^2$ decoupling for the parabola inspired from efficient congruencing. Making quantitative this proof matches a bound obtained by Bourgain for the discrete restriction problem for the parabola. We illustrate similarities and differences between this new proof and efficient congruencing and the proof of decoupling by Bourgain and Demeter. We also show where tools from decoupling such as $l^2 L^2$ decoupling, Bernstein, and ball inflation come into play.
Submission history
From: Zane Li [view email][v1] Sat, 26 May 2018 23:05:29 UTC (22 KB)
[v2] Thu, 25 Jul 2019 20:55:18 UTC (21 KB)
[v3] Mon, 24 Aug 2020 22:59:23 UTC (29 KB)
Current browse context:
math.CA
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.