arXiv:2005.07800 Abstract | arXiv Analytics

Published 2020-05-15Version 1

This note will describe an effective procedure for constructing critically finite real polynomial maps with specified combinatorics.

Comments: 21 pages, 26 figures, 1 table

Categories: math.DS

Subjects: 37F10, 37F20, 37E05, 37E25, 37M99

Keywords: thurston algorithm, critically finite real polynomial maps, constructing critically finite real polynomial, effective procedure, specified combinatorics

Related articles:

arXiv:1706.04177 [math.DS] (Published 2017-06-13)

The Thurston Algorithm for quadratic matings

Wolf Jung

arXiv:2009.10147 [math.DS] (Published 2020-09-21)

The W. Thurston Algorithm for Real Quadratic Rational Maps