On Cone Restriction Estimates in Higher Dimensions

Abstract

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.

arXiv commentUsed ChatGPT to assist with language editing and to check the consistency of some mathematical arguments and computations