Sharp Estimates for the $\bar{\partial}$-Neumann Problem on Regular Coordinate Domains
Complex Variables
2008-11-07 v1
Abstract
This paper treats subelliptic estimates for the -Neumann problem on a class of domains known as regular coordinate domains. Our main result is that the largest subelliptic gain for a regular coordinate domain is bounded below by a purely algebraic number, the inverse of twice the multiplicity of the ideal associated to a given boundary point.
Cite
@article{arxiv.0811.0830,
title = {Sharp Estimates for the $\bar{\partial}$-Neumann Problem on Regular Coordinate Domains},
author = {David W. Catlin and Jae-Seong Cho},
journal= {arXiv preprint arXiv:0811.0830},
year = {2008}
}
Comments
38 pages