2000 character limit reached
Universal holomorphic maps with slow growth I. An Algorithm (2306.11193v2)
Published 19 Jun 2023 in math.CV
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.