On thurston's core entropy algorithm dedicated to the memory of tan lei
Gao, Yan
Original · EN
The core entropy of polynomials, recently introduced by W. Thurston, is a dy-namical 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.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.