The core entropy for polynomials of higher degree
From MaRDI portal
Publication:6284789
arXiv1703.08703MaRDI QIDQ6284789FDOQ6284789
Authors: Yan Gao, Giulio Tiozzo 
Publication date: 25 March 2017
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.
Topological entropy (37B40) Dynamical systems involving maps of trees and graphs (37E25) Combinatorics and topology in relation with holomorphic dynamical systems (37F20)
This page was built for publication: The core entropy for polynomials of higher degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6284789)
