2000 character limit reached
Bergman kernels of Monomial Polyhedra
Published 10 Aug 2023 in math.CV | (2308.05834v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.