On Thurston’s core entropy algorithm
Author:
- 17 October 2019
- journal article
- research article
- Published by American Mathematical Society (AMS) in Transactions of the American Mathematical Society
- Vol. 373 (2) , 747-776
Abstract
The core entropy of polynomials, recently introduced by W. Thurston, is a dynamical invariant extending topological entropy for real maps to complex polynomials, whence providing a new tool to study the parameter space of polynomials. The base is a combinatorial algorithm allowing for the computation of the core entropy given by Thurston but without supplying a proof. In this paper, we will describe his algorithm and prove its validity.Keywords
All Related Versions
Funding Information
- National Natural Science Foundation of China (11501383)
This publication has 14 references indexed in Scilit:
- Expanding Thurston Maps2017
- Semiconjugacy to a map of a constant slopeDiscrete and Continuous Dynamical Systems-Series B, 2015
- Critical portraits for postcritically finite polynomialsFundamenta Mathematicae, 2009
- The Classification of Critically Preperiodic Polynomials as Dynamical SystemsJournal of the American Mathematical Society, 1992
- On iterated maps of the interval1988
- Entropy of piecewise monotone mappingsStudia Mathematica, 1980
- Geometric Topology in Dimensions 2 and 31977
- Disjointness in ergodic theory, minimal sets, and a problem in diophantine approximationTheory of Computing Systems, 1967
- Topological EntropyTransactions of the American Mathematical Society, 1965
- Concerning Upper Semi-Continuous Collections of ContinuaTransactions of the American Mathematical Society, 1925