2000 character limit reached
Universal holomorphic maps with slow growth I. An Algorithm
Published 19 Jun 2023 in math.CV | (2306.11193v2)
Abstract: We design an Algorithm to fabricate universal holomorphic maps between any two complex Euclidean spaces, within preassigned transcendental growth rate. As by-products, universal holomorphic maps from $\mathbb{C}n$ to $\mathbb{CP}m$ ($n\leqslant m$) and to complex tori having slow growth are obtained. We take inspiration from Oka manifolds theory, Nevanlinna theory, and hypercyclic operators theory.
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.