Bergman kernels of Monomial Polyhedra
Abstract
The Bergman kernels of monomial polyhedra are explicitly computed. Monomial polyhedra are a class of bounded pseudoconvex Reinhardt domains defined as sublevel sets of Laurent monomials. Their kernels are rational functions and are obtained by an application of Bell's transformation formula.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.