New procedure to generate multipliers in complex Neumann problem and effective Kohn algorithm (Q2400410)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | New procedure to generate multipliers in complex Neumann problem and effective Kohn algorithm |
scientific article |
Statements
New procedure to generate multipliers in complex Neumann problem and effective Kohn algorithm (English)
0 references
1 September 2017
0 references
This paper first discusses the effective version of Kohn's algorithm for subelliptic multipliers in the \(\bar{\partial}\)-Neumann problem. It explains the difference to the original version in detail by way of an example due to Catlin and D'Angelo that shows that the original version is not effective, i.e., does not result in the order of subellipticity being `computable' in terms of the type. The author next discusses a generalization of Kohn's technique to more general systems of partial differential equations. A special case of this analysis then leads to a new procedure for generating vector multipliers from matrix multipliers that, in dimension at least four, results in multipliers not available without this new procedure.
0 references
multiplier ideal sheaves
0 references
complex Neumann problem
0 references
\(\bar{\partial}\)-estimates
0 references
weakly pseudoconvex domains
0 references
Kohn's algorithm for multipliers
0 references
domains of finite type
0 references
0 references
0 references
0 references