Next Article in Journal
Probabilistic Inference for Dynamical Systems
Next Article in Special Issue
Strange Attractors Generated by Multiple-Valued Static Memory Cell with Polynomial Approximation of Resonant Tunneling Diodes
Previous Article in Journal
Overview of the 37th MaxEnt
Previous Article in Special Issue
A New Chaotic System with Stable Equilibrium: Entropy Analysis, Parameter Estimation, and Circuit Design
Open AccessArticle

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 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 core entropy; Thurston’s algorithm; Hubbard tree; external rays
Show Figures

Figure 1

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.

Show more citation formats Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop