The W. Thurston Algorithm Applied to Real Polynomial Maps
Araceli Bonifant, John Milnor, and Scott Sutherland
TL;DR
This paper presents an effective method for constructing critically finite real polynomial maps with specific combinatorial properties, advancing the understanding of polynomial dynamics.
Contribution
It introduces a novel procedure for constructing critically finite real polynomial maps with predetermined combinatorics.
Findings
Provides a systematic construction method
Enables targeted design of polynomial maps
Enhances understanding of polynomial map dynamics
Abstract
This note will describe an effective procedure for constructing critically finite real polynomial maps with specified combinatorics.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.