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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have