On Thurston's core entropy algorithm
Author:
Preprint
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
This publication has 5 references indexed in Scilit:
- Continuity of core entropy of quadratic polynomialsInventiones Mathematicae, 2015
- Semiconjugacy to a map of a constant slopeDiscrete and Continuous Dynamical Systems-Series B, 2015
- Dynamics of quadratic polynomials, I–IIActa Mathematica, 1997
- Entropy of piecewise monotone mappingsStudia Mathematica, 1980
- Disjointness in ergodic theory, minimal sets, and a problem in diophantine approximationTheory of Computing Systems, 1967