The Medusa algorithm for polynomial matings

DOI10.1090/S1088-4173-2012-00245-7MaRDI QIDQ2842880zbMATH OpenOpenAlexFDO

Authors Suzanne Hruska Boyd, Christian Henriksen

Publication date 19 August 2013

Published in Conformal Geometry and Dynamics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1102.5047

zbMATH Keywords

algorithmJulia setLattès examplesmatingMedusa algorithmpostcritically finite quadratic polynomialsquadratic rational mapshared matingsThurston's characterizationtuning sequences of matings

Mathematics Subject Classification ID

Dynamics of complex polynomials, rational maps, entire and meromorphic functions; Fatou and Julia sets (37F10) Approximation methods and numerical treatment of dynamical systems (37M99)

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, Lattes examples, and tuning sequences of matings.

Recommendations

• scientific article; zbMATH DE number 861360
• A polynomial algorithm for b-matchings: An alternative approach
• The \(N\)-dimensional matching polynomial
• A linear algorithm for a perfect matching in polyomino graphs
• Matching polynomials: A matrix approach and its applications
• Polynomial algorithm for solving cross-matching puzzles
• A separation algorithm for the matchable set polytope
• Random pseudo-polynomial algorithms for exact matroid problems
• Algebraic algorithms for matching and matroid problems
• scientific article; zbMATH DE number 4187824

Cites work

• A partial description of parameter space of rational maps of degree two. I
• A proof of Thurston's topological characterization of rational functions
• Convergence of pinching deformations and matings of geometrically finite polynomials
• scientific article; zbMATH DE number 3844090 (Why is no real title available?)
• scientific article; zbMATH DE number 3758648 (Why is no real title available?)
• scientific article; zbMATH DE number 1338133 (Why is no real title available?)
• scientific article; zbMATH DE number 739002 (Why is no real title available?)
• scientific article; zbMATH DE number 2096504 (Why is no real title available?)
• Mating Siegel quadratic polynomials
• Matings of quadratic polynomials
• Pasting Together Julia Sets: A Worked Out Example of Mating
• Tan Lei and Shishikura's example of non-mateable degree 3 polynomials without a Lévy cycle
• Thurston's pullback map on the augmented Teichmüller space and applications
• Twisted matings and equipotential gluings

Cited in

(6)

• Questions about polynomial matings
• Thurston's algorithm and rational maps from quadratic polynomial matings
• The W. Thurston algorithm applied to real polynomial maps
• Algorithmic construction of Hurwitz maps
• Mating Siegel and parabolic quadratic polynomials
• Mating Siegel and Thurston quadratic polynomials

This page was built for publication: The Medusa algorithm for polynomial matings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2842880)