arXiv · 1511.06513
On thurston's core entropy algorithm dedicated to the memory of tan lei
Abstract
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Yan Gao. 2017-02-24. On thurston's core entropy algorithm dedicated to the memory of tan lei. https://arxiv.org/abs/1511.06513
Cite the original work for its findings. Save a collection to share your selection of sources.