Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

The Cone Restriction: An Old Approach Revisited

Xiangyu Wang

TL;DR

The paper improves cone restriction bounds in higher dimensions by recasting Ou-Wang's approach into a recursive, algorithmic framework built on polynomial partitioning and the nested polynomial Wolff axiom. It introduces two interrelated algorithms that extract polynomial structure and multi-scale geometry, enabling a refined $k$-broad estimate for the cone. A careful orchestration of tangent, cellular, and algebraic cases, together with transverse equidistribution and wave-packet machinery, yields a sharp $L^p$ bound for Ef with $p > 2 + \lambda n^{-1} + O(n^{-2})$ (\lambda ≈ 2.59607). This advances the Fourier restriction program for cones and has implications for related Kakeya-type problems and dispersive estimates. The methods blend iterative partitioning, multiscale geometry, and incidence bounds to push the known range of exponents for cone restriction in higher dimensions.

Abstract

We consider the Ou-Wang's approach 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.

The Cone Restriction: An Old Approach Revisited

TL;DR

The paper improves cone restriction bounds in higher dimensions by recasting Ou-Wang's approach into a recursive, algorithmic framework built on polynomial partitioning and the nested polynomial Wolff axiom. It introduces two interrelated algorithms that extract polynomial structure and multi-scale geometry, enabling a refined -broad estimate for the cone. A careful orchestration of tangent, cellular, and algebraic cases, together with transverse equidistribution and wave-packet machinery, yields a sharp bound for Ef with (\lambda ≈ 2.59607). This advances the Fourier restriction program for cones and has implications for related Kakeya-type problems and dispersive estimates. The methods blend iterative partitioning, multiscale geometry, and incidence bounds to push the known range of exponents for cone restriction in higher dimensions.

Abstract

We consider the Ou-Wang's approach 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.

Paper Structure

This paper contains 13 sections, 29 theorems, 238 equations, 3 figures.

Table of Contents

  1. Introduction
  2. Preliminaries
  3. Notational Conventions
  4. Wave Packet Decomposition
  5. Some Kakeya-type geometric results
  6. $k$-broad Norms
  7. Transverse Equidistribution Estimates
  8. Polynomial Partitioning
  9. Finding Polynomial Structure
  10. The first algorithm
  11. The second algorithm
  12. Establish the $k$-broad estimates
  13. Proof of Theorem \ref{['t2.22']}

Key Result

Theorem 1.3

Let $n \geq 3$. For all $p,q>2$ satisfy there holds

Figures (3)

  • Figure 1: A sector of a truncated cone.
  • Figure 2: The spatial structure of a tube.
  • Figure 3: A scenario that suggests the transverse equidistribution fails.

Theorems & Definitions (42)

  • Conjecture 1.1
  • Conjecture 1.2
  • Theorem 1.3: OW, Theorem 1
  • Theorem 1.4: OW, Theorem 2
  • Theorem 1.5
  • Corollary 1.6
  • Lemma 2.1: OW, Section 2.2
  • Corollary 2.2
  • Corollary 2.3
  • Lemma 2.4
  • ...and 32 more