Abstract

This chapter asks when a given (postcritically finite) rational map f arises as a mating. Mating occurs when the filled Julia sets of two polynomials of the same degree are dynamically related via external rays. This chapter seeks to tackle the opposite of mating—nonmating. To do this, a sufficient condition when the given rational map f arises as a mating is given. If this condition is satisfied, the chapter presents a simple explicit algorithm to unmate the rational map. This means that f is decomposed into polynomials that, when mated, yield f. Several examples of unmatings are then presented.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.