Analytic singularities of the Bergman kernel for tubes (Q1847848): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q621300 |
Changed an Item |
||
Property / author | |||
Property / author: Gábor Francsics / rank | |||
Normal rank |
Revision as of 07:07, 20 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Analytic singularities of the Bergman kernel for tubes |
scientific article |
Statements
Analytic singularities of the Bergman kernel for tubes (English)
0 references
27 October 2002
0 references
Let \(\Omega\subset\mathbb R^n\) be a bounded, convex, and open set with real analytic boundary. Let \(T_\Omega\subset\mathbb C^n\) be the tube with base \(\Omega\), and let \(\mathcal B(z,w)\) be the Bergman kernel of \(T_\Omega\). If \(\Omega\) is strongly convex, then \(\mathcal B(z,w)\) is analytic away from the boundary diagonal. In the weakly convex case this is no longer true. The authors show that off-diagonal singularities are precisely described by the characteristic lines. These lines are contained in the boundary of \(T_\Omega\), and they are projections of the Treves curves. These curves are symplectic invariants that are determined by the CR structure of the boundary of \(T_\Omega\). Note that Treves curves exist only when \(\Omega\) has at least one weakly convex boundary point. A brief discussion of the formula of L.~Boutet de Monvel for \(\mathcal B(z,w)\) is given. The precise version of the stationary phase formula that the authors need is proved. Using the method of Pólya, it is proved that the zeros of the entire function \(\mathcal N(\eta)=\int_{-\infty}^{+\infty}e^{2(\eta s-s^m)} ds\), \(m\geq 2\) is even, which are closest to the origin are simple ones.
0 references
Bergman kernel for tubes
0 references
analytic singularities away from the boundary diagonal
0 references
characteristic lines
0 references
symplectic geometry
0 references
Treves curves
0 references
stationary phase formula
0 references
Gevrey regularity
0 references
algorithm of Pólya
0 references