The W. Thurston algorithm applied to real polynomial maps
From MaRDI portal
critically finite real polynomialsexpansivenessframing pointshigher-order critical pointslocal degreepiecewise linear modelreal critical pointsThurston algorithm
Dynamical systems involving maps of the interval (37E05) Dynamical systems involving maps of trees and graphs (37E25) Dynamics of complex polynomials, rational maps, entire and meromorphic functions; Fatou and Julia sets (37F10) Combinatorics and topology in relation with holomorphic dynamical systems (37F20)
Abstract: This note will describe an effective procedure for constructing critically finite real polynomial maps with specified combinatorics.
Recommendations
- Thurston's algorithm and rational maps from quadratic polynomial matings
- On open real polynomial maps
- scientific article; zbMATH DE number 177485
- A theorem on iterations of polynomial maps in several variables
- An algebraic characterization of expanding Thurston maps
- scientific article; zbMATH DE number 421678
- Integral Geometry and Real Zeros of Thue–Morse Polynomials
- Polynomial classification algorithm of the Thomson problem solutions
- On the real roots of generalized Thue-Morse polynomials
- The resultants method for approximating real fixed points of polynomials
Cites work
- A proof of Thurston's topological characterization of rational functions
- Admissibility of kneading sequences and structure of Hubbard trees for quadratic polynomials
- Critical portraits for postcritically finite polynomials
- Cubic polynomial maps with periodic critical orbit. II: Escape regions
- From rubber bands to rational maps: a research report
- scientific article; zbMATH DE number 5354061 (Why is no real title available?)
- scientific article; zbMATH DE number 1273298 (Why is no real title available?)
- scientific article; zbMATH DE number 739002 (Why is no real title available?)
- scientific article; zbMATH DE number 3057606 (Why is no real title available?)
- Hubbard trees
- Newton methods for nonlinear problems. Affine invariance and adaptive algorithms.
- On entropy and monotonicity for real cubic maps (with an appendix by Adrien Douady and Pierrette Sentenac)
- Tan Lei and Shishikura's example of non-mateable degree 3 polynomials without a Lévy cycle
- The Classification of Critically Preperiodic Polynomials as Dynamical Systems
- The Medusa algorithm for polynomial matings
- Thurston equivalence of topological polynomials
- Thurston's pullback map on the augmented Teichmüller space and applications
Cited in
(2)
This page was built for publication: The W. Thurston algorithm applied to real polynomial maps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5013354)