Q-effectiveness for holomorphic subelliptic multipliers
Dmitri Zaitsev, Sung Yeon Kim

TL;DR
This paper solves the effectiveness problem in Kohn's algorithm for generating holomorphic subelliptic multipliers on special domains, leading to controlled subelliptic estimates for $(0,q)$ forms.
Contribution
It introduces a solution to the effectiveness problem in Kohn's algorithm for all $q$, enabling explicit subelliptic estimates on special domains.
Findings
Effective subelliptic estimates for $(0,q)$ forms with controlled Sobolev exponent
Solution to the effectiveness problem in Kohn's algorithm for arbitrary $q$
Application to domains defined by sums of squares of holomorphic functions
Abstract
We provide a solution to the effectiveness problem in Kohn's algorithm for generating holomorphic subelliptic multipliers for forms for arbitrary . As an application, we obtain subelliptic estimates for forms with effectively controlled order (the Sobolev exponent) for domains given by sums of squares of holomorphic functions (J.J. Kohn called them "special domains"). These domains are of particular interest due to their relation with complex and algebraic geometry. Our methods include triangular resolutions introduced by the authors in their previous work.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgebraic Geometry and Number Theory · Cryptography and Residue Arithmetic · Analytic Number Theory Research
