A Straightening Theorem for non-Autonomous Iteration

Details A Straightening Theorem for non-Autonomous Iteration A Straightening Theorem for non-Autonomous Iteration

2011-06-22

arxiv.org/abs/1106.4581v4

Mathematics

Dynamical Systems

Scientific paper

The classical straightening theorem as proved by Douady and Hubbard shows that a polynomial-like sequence is hybrid equivalent to a polynomial. We generalize this result to non-autonomous iteration where one considers composition sequences arising from a varying sequence of functions. In order to do this, new techniques are required to control the distortion and quasiconformal dilatation of the hybrid equivalence. In particular, the Caratheodory topology for pointed domains allows us to specify the appropriate bounds on the sequence of sets on which the polynomial-like mapping sequence is defined and give us good estimates on the degree of distortion and quasiconformality.

Affiliated with

Also associated with

No associations

Rating

A Straightening Theorem for non-Autonomous Iteration does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Straightening Theorem for non-Autonomous Iteration, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Straightening Theorem for non-Autonomous Iteration will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-469027