Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2411.02961 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- We revisit the Ou-Wang's approach to the cone restriction problem via polynomial partitioning. By recasting their inductive scheme as a recursive algorithm and incorporating the nested polynomial Wolff axioms, we obtain improved bounds for cone restriction estimates in higher dimensions.