### Abstract

The Medusa algorithm takes as input two postcritically finite quadratic polynomials and outputs the quadratic rational map which is the mating of the two polynomials (if it exists). Specifically, the output is a sequence of approximations for the parameters of the rational map, as well as an image of its Julia set. Whether these approximations converge is answered using Thurston's topological characterization of rational maps.

This algorithm was designed by John Hamal Hubbard, and implemented in 1998 by Christian Henriksen and REU students David Farris and Kuon Ju Liu.

In this paper we describe the algorithm and its implementation, discuss some output from the program (including many pictures) and related questions. Specifically, we include images and a discussion for some shared matings, Lattès examples, and tuning sequences of matings.

This algorithm was designed by John Hamal Hubbard, and implemented in 1998 by Christian Henriksen and REU students David Farris and Kuon Ju Liu.

In this paper we describe the algorithm and its implementation, discuss some output from the program (including many pictures) and related questions. Specifically, we include images and a discussion for some shared matings, Lattès examples, and tuning sequences of matings.

Original language | English |
---|---|

Journal | Conformal Geometry and Dynamics |

Volume | 16 |

Pages (from-to) | 161-183 |

Number of pages | 25 |

ISSN | 1088-4173 |

Publication status | Published - 2012 |

### Keywords

- math.DS

## Cite this

Boyd, S. H., & Henriksen, C. (2012). The Medusa Algorithm for Polynomial Matings.

*Conformal Geometry and Dynamics*,*16*, 161-183.