Sharp Estimates for the $\bar{\partial }$-Neumann Problem on Regular Coordinate Domains

Abstract

This paper treats subelliptic estimates for the $\bar{\partial }$-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.

38 pages

References in corpus (2)

• Effective Termination of Kohn's Algorithm for Subelliptic Multipliers
• Monotonicity of Subelliptic Estimates on Rigid Pseudoconvex Domains