数学
商
投影(关系代数)
伯格曼核
纯数学
算法
作者
Chase Bender,Debraj Chakrabarti,Luke D. Edholm,Meera Mainkar
标识
DOI:10.4153/s0008414x21000079
摘要
We obtain sharp ranges of $L^p$-boundedness for domains in a wide class of Reinhardt domains representable as sub-level sets of monomials, by expressing them as quotients of simpler domains. We prove a general transformation law relating $L^p$-boundedness on a domain and its quotient by a finite group. The range of $p$ for which the Bergman projection is $L^p$-bounded on our class of Reinhardt domains is found to shrink as the complexity of the domain increases.
科研通智能强力驱动
Strongly Powered by AbleSci AI