On the core entropy of Newton maps

DOI10.1007/S11425-021-2010-1OpenAlexMaRDI QIDQ6139324FDO

Authors

Publication date 18 January 2024

Published in Science China. Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1906.01523

zbMATH Keywords

polynomialNewton mapcore entropyextended Newton graphcritical marking

Mathematics Subject Classification ID

Topological entropy (37B40) 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: In this paper, we define the core entropy for postcritically-finite Newton maps and study its continuity within this family. We show that the entropy function is not continuous in this family, which is different from the polynomial case studied by Thurston, Gao, Dudko- Schleicher, Tiozzo [Th+, GT, DS, Ti2], and describe completely the continuity of the entropy function at generic parameters.

Recommendations

• Continuity of core entropy of quadratic polynomials
• Core entropy of quadratic polynomials
• On Thurston’s core entropy algorithm
• Core entropy of polynomials with a critical point of maximal order
• Publication:4868362

Cites work

• scientific article; zbMATH DE number 4132532 (Why is no real title available?)
• scientific article; zbMATH DE number 4086578 (Why is no real title available?)
• scientific article; zbMATH DE number 520010 (Why is no real title available?)
• scientific article; zbMATH DE number 1139518 (Why is no real title available?)
• scientific article; zbMATH DE number 1547004 (Why is no real title available?)
• scientific article; zbMATH DE number 788327 (Why is no real title available?)
• scientific article; zbMATH DE number 1413947 (Why is no real title available?)
• A Classification of Postcritically Finite Newton Maps
• A characterization of hyperbolic rational maps
• A combinatorial classification of postcritically fixed Newton maps
• A proof of Thurston's topological characterization of rational functions
• Biaccessibility in quadratic Julia sets
• Combinatorial continuity in complex polynomial dynamics
• Combinatorial properties of Newton maps
• Continuity of core entropy of quadratic polynomials
• Core entropy of quadratic polynomials
• Criterion for rays landing together
• Critical portraits for postcritically finite polynomials
• Degree-\(d\)-invariant laminations
• Distortion control of conjugacies between quadratic polynomials
• Dynamics in One Complex Variable. (AM-160)
• Dynamics of Newton maps
• External rays to periodic points
• Fixed points of polynomial maps. Part II. Fixed point portraits
• Hausdorff dimension and biaccessibility for polynomial Julia sets
• Hausdorff dimension of biaccessible angles for quadratic polynomials
• How to find all roots of complex polynomials by Newton's method.
• Hubbard trees
• Hyperbolic-parabolic deformations of rational maps
• Moduli space of cubic Newton maps
• Newton maps as matings of cubic polynomials
• On Newton's method for entire functions
• On Thurston’s core entropy algorithm
• On local connectivity for the Julia set of rational maps: Newton's famous example
• On the dynamics of polynomial-like mappings
• Rational laminations of complex polynomials
• Semiconjugacy to a map of a constant slope
• The Classification of Critically Preperiodic Polynomials as Dynamical Systems
• The connectivity of the Julia set and fixed points
• The iteration of cubic polynomials. II: Patterns and parapatterns
• The landing of parameter rays at non-recurrent critical portraits
• Topological Entropy

This page was built for publication: On the core entropy of Newton maps

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6139324)