Papers
Topics
Authors
Recent
2000 character limit reached

Poincaré functions with spiders' webs

Published 2 Oct 2010 in math.DS and math.CV | (1010.0299v1)

Abstract: For a polynomial p with a repelling fixed point w, we consider Poincar\'{e} functions of p at w, i.e. entire functions L which satisfy L(0)=w and p(L(z))=L(p'(w)*z) for all z in the complex plane. We show that if the component of the Julia set of p that contains w equals {w}, then the (fast) escaping set of L is a spider's web; in particular it is connected. More precisely, we classify all linearizers of polynomials with regards to the spider's web structure of the set of all points which escape faster than the iterates of the maximum modulus function at a sufficiently large point.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.