Jump to ContentJump to Main Navigation
Fourier Restriction for Hypersurfaces in Three Dimensions and Newton Polyhedra (AM-194)$
Users without a subscription are not able to see the full content.

Isroil A. Ikromov and Detlef Müller

Print publication date: 2016

Print ISBN-13: 9780691170541

Published to Princeton Scholarship Online: October 2017

DOI: 10.23943/princeton/9780691170541.001.0001

Show Summary Details
Page of

PRINTED FROM PRINCETON SCHOLARSHIP ONLINE (www.princeton.universitypressscholarship.com). (c) Copyright Princeton University Press, 2017. All Rights Reserved. Under the terms of the licence agreement, an individual user may print out a PDF of a single chapter of a monograph in HSO for personal use (for details see http://www.universitypressscholarship.com/page/privacy-policy).date: 19 April 2018

The Case When hlin(φ‎) ≥ 2: Preparatory Results

The Case When hlin(φ‎) ≥ 2: Preparatory Results

Chapter:
(p.105) Chapter Six The Case When hlin(φ‎) ≥ 2: Preparatory Results
Source:
Fourier Restriction for Hypersurfaces in Three Dimensions and Newton Polyhedra (AM-194)
Author(s):

Isroil A. Ikromov

Detlef Müller

Publisher:
Princeton University Press
DOI:10.23943/princeton/9780691170541.003.0006

This chapter turns to the case where hsubscript lin(φ‎) ≥ 2. In a first step, the chapter performs a decomposition of the remaining piece Ssubscript Greek small letter psi of the surface S. Then, in the domains Dₗ the chapter once again applies dyadic decomposition techniques in combination with rescaling arguments, making use of the dilations associated with the weight κ‎ₗ. But serious new problems arise, caused by the nonlinear change from the coordinates (x₁, x₂) to the adapted coordinates (y₁, y₂). Therefore, the chapter takes a closer look at the domain Dsubscript pr and devises a further decomposition of the domain Dsubscript pr into various subdomains of “type” Dsubscript (l) and Esubscript (l).

Keywords:   preparatory results, dyadic decompositions, restriction estimates, transition domains, stopping-time algorithm, open cases

Princeton Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us.