pith. sign in

arxiv: math/9208204 · v1 · submitted 1992-08-13 · 🧮 math.DS

Hubbard forests

classification 🧮 math.DS
keywords finitemapsclassificationhubbarditselfpost-criticallywillcase
0
0 comments X
read the original abstract

The theory of Hubbard trees provides an effective classification of non-linear post-critically finite polynomial maps from \C to itself. This note will extend this classification to the case of maps from a finite union of copies of \C to itself. Maps which are post-critically finite and nowhere linear will be characterized by a ``forest'', which is made up out of one tree in each copy of \C.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.