加载中…
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.

生成讲解博客的中文版本

生成AI智能校验的中文版本