2000 character limit reached
Composition operators on the polydisc (2206.14758v1)
Published 29 Jun 2022 in math.CV and math.FA
Abstract: We study the boundedness of composition operators on the weighted Bergman spaces and the Hardy space over the polydisc. For arbitrary polydisc we prove the rank sufficiency theorem which, in particular, provides us with a simple criterion describing boundedness of composition operators on the spaces over the bidisc. Such a consistent characterization is obtained for the classical Bergman space over the tridisc.
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.