Unmating of rational maps, sufficient criteria and examples

Details Unmating of rational maps, sufficient criteria and examples Unmating of rational maps, sufficient criteria and examples

2011-10-31

arxiv.org/abs/1110.6784v1

Mathematics

Complex Variables

35 pages, 8 figures

Scientific paper

Douady and Hubbard introduced the operation of mating of polynomials. This identifies two filled Julia sets and the dynamics on them via external rays. In many cases one obtains a rational map. Here the opposite question is tackled. Namely we ask when a given (postcritically finite) rational map $f$ arises as a mating. A sufficient condition when this is possible is given. If this condition is satisfied, we present a simple explicit algorithm to unmate the rational map. This means we decompose $f$ into polynomials, that when mated yield $f$. Several examples of unmatings are presented.

Affiliated with

Also associated with

No associations

Rating

Unmating of rational maps, sufficient criteria and examples 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 Unmating of rational maps, sufficient criteria and examples, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Unmating of rational maps, sufficient criteria and examples will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-147708