Non-autonomous iteration of polynomials in the complex plane
Abstract
We consider a sequence (pn)n=1∞ of polynomials with uniformly bounded zeros and p1≥ 1, pn≥ 2 for n≥ 2, satisfying certain asymptotic conditions. We prove that the function sequence (1 pn·...· p1+|pn... p1|)n=1∞ is uniformly convergent in C. The non-autonomous filled Julia set K[(pn)n=1∞] generated by the polynomial sequence (pn)n=1∞ is defined and shown to be compact and regular with respect to the Green function. Our toy example is generated by tn=12n-1Tn,\ n∈\1,2,...\, where Tn is the classical Chebyshev polynomial of degree n.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.