Optimization of Thurston’s Core Entropy Algorithm for Polynomials with a Critical Point of Maximal Order
Gamaliel Blé, Domingo González
Entropy · 2018
doi:10.3390/e20090695 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
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.
Abstract licence: CC BY
References17
17 more references, whose wording the paper’s licence keeps private.
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.