Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Core Entropy of Quadratic Polynomials

Core Entropy of Quadratic Polynomials We give a combinatorial definition of “core entropy” for quadratic polynomials as the growth exponent of the number of certain precritical points in the Julia set (those that separate the α\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$\alpha $$\end{document} fixed point from its negative). This notion extends known definitions that work in cases when the polynomial is postcritically finite or when the topology of the Julia set has good properties, and it applies to all quadratic polynomials in the Mandelbrot set. We prove that core entropy is continuous as a function of the complex parameter. In fact, we model the Julia set as an invariant quadratic lamination in the sense of Thurston: this depends on the external angle of a parameter in the boundary of the Mandelbrot set, and one can define core entropy directly from the angle in combinatorial terms. As such, core entropy is continuous as a function of the external angle. Moreover, we prove a conjecture of Giulio Tiozzo about local and global maxima of core entropy as a function of external angles: local maxima are exactly dyadic angles, and the unique global maximum within any wake occurs at the dyadic angle of lowest denominator. We also describe where local minima occur. An appendix by Wolf Jung relates different concepts of core entropy and biaccessibility dimension and thus shows that biaccessibility dimension is continuous as well. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Arnold Mathematical Journal Springer Journals

Core Entropy of Quadratic Polynomials

Arnold Mathematical Journal , Volume 6 (3-4) – Mar 25, 2020

Loading next page...
 
/lp/springer-journals/core-entropy-of-quadratic-polynomials-nz6CSjdZtF
Publisher
Springer Journals
Copyright
Copyright © Institute for Mathematical Sciences (IMS), Stony Brook University, NY 2020
ISSN
2199-6792
eISSN
2199-6806
DOI
10.1007/s40598-020-00134-y
Publisher site
See Article on Publisher Site

Abstract

We give a combinatorial definition of “core entropy” for quadratic polynomials as the growth exponent of the number of certain precritical points in the Julia set (those that separate the α\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$\alpha $$\end{document} fixed point from its negative). This notion extends known definitions that work in cases when the polynomial is postcritically finite or when the topology of the Julia set has good properties, and it applies to all quadratic polynomials in the Mandelbrot set. We prove that core entropy is continuous as a function of the complex parameter. In fact, we model the Julia set as an invariant quadratic lamination in the sense of Thurston: this depends on the external angle of a parameter in the boundary of the Mandelbrot set, and one can define core entropy directly from the angle in combinatorial terms. As such, core entropy is continuous as a function of the external angle. Moreover, we prove a conjecture of Giulio Tiozzo about local and global maxima of core entropy as a function of external angles: local maxima are exactly dyadic angles, and the unique global maximum within any wake occurs at the dyadic angle of lowest denominator. We also describe where local minima occur. An appendix by Wolf Jung relates different concepts of core entropy and biaccessibility dimension and thus shows that biaccessibility dimension is continuous as well.

Journal

Arnold Mathematical JournalSpringer Journals

Published: Mar 25, 2020

There are no references for this article.