Cargando…
Optimization of Thurston’s Core Entropy Algorithm for Polynomials with a Critical Point of Maximal Order
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.
Autores principales: | Blé, Gamaliel, González, Domingo |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
MDPI
2018
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7513226/ https://www.ncbi.nlm.nih.gov/pubmed/33265784 http://dx.doi.org/10.3390/e20090695 |
Ejemplares similares
-
Expanding Thurston maps
por: Bonk, Mario, et al.
Publicado: (2017) -
Hugh Champneys Thurston
Publicado: (1919) -
In the tradition of Thurston: geometry and topology
por: Ohshika, Ken’ichi, et al.
Publicado: (2020) -
Automorphisms of surfaces after Nielsen and Thurston
por: Casson, Andrew J, et al.
Publicado: (1988) -
Ergodic theory of expanding thurston maps
por: Li, Zhiqiang
Publicado: (2017)