The core entropy for polynomials of higher degree
Dynamical Systems
2019-06-18 v2
Abstract
As defined by W. Thurston, the core entropy of a polynomial is the entropy of the restriction to its Hubbard tree. For each d >= 2, we study the core entropy as a function on the parameter space of polynomials of degree d, and prove it varies continuously both as a function of the combinatorial data and of the coefficients of the polynomials. This generalizes a conjecture of Thurston for quadratic polynomials.
Keywords
Cite
@article{arxiv.1703.08703,
title = {The core entropy for polynomials of higher degree},
author = {Yan Gao and Giulio Tiozzo},
journal= {arXiv preprint arXiv:1703.08703},
year = {2019}
}
Comments
40 pages, 11 figures