English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We construct combinatorial Hubbard trees for all unicritical polynomials, andfor all exponential maps, for which the critical (singular) value does notescape. More precisely, out of an external angle, or more generally a kneadingsequence, we construct a forward invariant tree for which the critical orbithas the given kneading sequence.  When the critical orbit of a unicritical polynomial is periodic orpreperiodic, then the existence of a Hubbard tree is classical. Our trees existeven when the critical orbit is infinite (in many cases, this yields infinitetrees), and even when the polynomial Julia set fails to be path connected. Inthe latter case, our trees cannot be reconstructed from the Julia set incomplex dynamics. Our trees also exist for kneading sequences that do not arisein complex dynamics (for non complex-admissible kneading sequences).

Combinatorial Hubbard trees for postcritically infinite unicritical polynomials and exponential maps