2020
DOI: 10.1007/s40598-020-00134-y
|View full text |Cite
|
Sign up to set email alerts
|

Core Entropy of Quadratic Polynomials

Abstract: We give a combinatorial definition of "core entropy" for quadratic polynomials as the growth exponent of the number of certain precritical points in the Julia set (those that separate the α fixed point from its negative). This notion extends known definitions that work in cases when the polynomial is postcritically finite or when the topology of the Julia set has good properties, and it applies to all quadratic polynomials in the Mandelbrot set.We prove that core entropy is continuous as a function of the comp… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
8
0
3

Year Published

2021
2021
2024
2024

Publication Types

Select...
5
3

Relationship

1
7

Authors

Journals

citations
Cited by 8 publications
(11 citation statements)
references
References 28 publications
0
8
0
3
Order By: Relevance
“…The core entropy has been studied extensively in the literature. It is known that hpf q is a continuous function (see [Tio16,DS20] for the quadratic case and [GT21] for the general case), settling a conjecture of Thurston.…”
Section: Introductionmentioning
confidence: 94%
“…The core entropy has been studied extensively in the literature. It is known that hpf q is a continuous function (see [Tio16,DS20] for the quadratic case and [GT21] for the general case), settling a conjecture of Thurston.…”
Section: Introductionmentioning
confidence: 94%
“…In both cases, the regularity constant involves the value of the entropy itself. Dudko and Schleicher and Tiozzo [16,44] have developed the theory of core entropy of complex quadratic polynomials, as introduced by Thurston. They proved continuous dependence of core entropy on the parameter.…”
Section: Further Remarksmentioning
confidence: 99%
“…One is the Hausdorff dimension of certain subset of the unit circle S 1 , that is invariant under σ d (w) = w d . See [10,Appendix] for discussions restricted to degree two. Another is the continuous extension of Thurston's algorithm obtained in [37,Theorem 8.2].…”
Section: Introductionmentioning
confidence: 99%