Jump to ContentJump to Main Navigation
Advances in AnalysisThe Legacy of Elias M. Stein$
Users without a subscription are not able to see the full content.

Charles Fefferman, Alexandru D. Ionescu, D.H. Phong, and Stephen Wainger

Print publication date: 2014

Print ISBN-13: 9780691159416

Published to University Press Scholarship Online: October 2017

DOI: 10.23943/princeton/9780691159416.001.0001

Show Summary Details
Page of
date: 05 April 2020

On Div-Curl for Higher Order

On Div-Curl for Higher Order

Chapter:
(p.245) Chapter Eleven On Div-Curl for Higher Order
Source:
Advances in Analysis
Author(s):

Loredana Lanzani

Andrew S. Raich

, Charles Fefferman, Alexandru D. Ionescu, D. H. Phong, Stephen Wainger
Publisher:
Princeton University Press
DOI:10.23943/princeton/9780691159416.003.0011

This chapter produces a new class of differential operators of order k (where k is any given positive integer) that satisfy an appropriate analogue of a Gagliardo–Nirenberg inequality for functions and contain the operators introduced in the works of Bourgain and Brezis and Van Schaftingen. The research in this chapter is furthermore based on div/curl-type phenomena studied by both Stein as well as one of the authors of this chapter. Thus, the chapter first introduces the notion of admissible degree increment, and describes the necessary operators and theorems. Proofs are then discussed later on in the chapter, before it concludes with further remarks on some of the problems and theorems advanced earlier on.

Keywords:   differential operators, div-curl, higher order, admissible degree increment, Gagliardo–Nirenberg inequality

University Press 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 .