The Cone Restriction: An Old Approach Revisited

Published 5 Nov 2024 in math.CA | (2411.02961v4)

Abstract: We consider the approach of Ou and Wang to cone restriction via polynomial partitioning. By restructuring their induction arguments into a recursive algorithm and applying the nested polynomial Wolff axioms, we refine the bounds on cone restriction estimate in higher dimensions.

Abstract PDF HTML Upgrade to Chat

Authors (1)

Xiangyu Wang

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Top Community Prompts

Explain it Like I'm 14

Practical Applications

Conceptual Simplification

Sign Up to Activate View All Prompts

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.