2000 character limit reached
Sharp subelliptic estimates in the $\bar\partial$-Neumann problem via an uncertainty principle
Published 27 Oct 2023 in math.CV and math.CA | (2310.18246v2)
Abstract: The problem of giving a (CR-)geometric description of the best possible order of a subelliptic estimate at a boundary point in the $\bar\partial$-Neumann problem is largely open. In this paper, we introduce a novel technique based on a "$\bar\partial$-uncertainty principle" and, as an application, we determine the sharp order of subellipticity at the origin for a large class of Kohn's special domains in ambient dimension $\leq 5$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.