Optimization of Thurston’s Core Entropy Algorithm for Polynomials with a Critical Point of Maximal Order
División Académica de Ciencias Básicas, Universidad Juárez Autónoma de Tabasco, Carretera Cunduacán-Jalpa Km 1, Cunduacán Tabasco 86690, Mexico
*
Author to whom correspondence should be addressed.
Entropy 2018, 20(9), 695; https://doi.org/10.3390/e20090695
Received: 1 August 2018
/
Revised: 5 September 2018
/
Accepted: 5 September 2018
/
Published: 11 September 2018
(This article belongs to the Special Issue Nonlinear Dynamics and Entropy of Complex Systems with Hidden and Self-excited Attractors)
This paper discusses some properties of the topological entropy systems generated by polynomials of degree d in their Hubbard tree. An optimization of Thurston’s core entropy algorithm is developed for a family of polynomials of degree d.
View Full-Text
Keywords:
core entropy; Thurston’s algorithm; Hubbard tree; external rays
▼
Show Figures
Figure 1
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited
MDPI and ACS Style
Blé, G.; González, D. Optimization of Thurston’s Core Entropy Algorithm for Polynomials with a Critical Point of Maximal Order. Entropy 2018, 20, 695. https://doi.org/10.3390/e20090695
AMA Style
Blé G, González D. Optimization of Thurston’s Core Entropy Algorithm for Polynomials with a Critical Point of Maximal Order. Entropy. 2018; 20(9):695. https://doi.org/10.3390/e20090695
Chicago/Turabian StyleBlé, Gamaliel, and Domingo González. 2018. "Optimization of Thurston’s Core Entropy Algorithm for Polynomials with a Critical Point of Maximal Order" Entropy 20, no. 9: 695. https://doi.org/10.3390/e20090695
Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.
