A connecting lemma for rational maps satisfying a no growth condition

Mathematics – Dynamical Systems

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Part of IMS preprint at Stony Brook #2000/11, in revised form

Scientific paper

We introduce and study a non uniform hyperbolicity condition for complex rational maps, that does not involve a growth condition. We call this condition Backward Contraction. We show this condition is weaker than the Collet-Eckmann condition, and than the summability condition with exponent~1. Our main result is a connecting lemma for Backward Contracting rational maps, roughly saying that we can perturb a rational map to connect each critical orbit in the Julia set with an orbit that does not accumulate on critical points. The proof of this result is based on Thurston's algorithm and some rigidity properties of quasi-conformal maps. We also prove that the Lebesgue measure of the Julia set of a Backward Contracting rational map is zero, when it is not the whole Riemann sphere. The basic tool of this article are sets having a Markov property for backward iterates, that are holomorphic analogues of nice intervals in real one-dimensional dynamics.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A connecting lemma for rational maps satisfying a no growth condition 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 connecting lemma for rational maps satisfying a no growth condition, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A connecting lemma for rational maps satisfying a no growth condition will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-471386

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.