Related papers: On thurston's core entropy algorithm dedicated to …
As defined by W. Thurston, the core entropy of a polynomial is the entropy of the restriction to its Hubbard tree. For each d >= 2, we study the core entropy as a function on the parameter space of polynomials of degree d, and prove it…
The core entropy of polynomials, recently introduced by W. Thurston, is a dynamical invariant which can be defined purely in combinatorial terms, and provides a useful tool to study parameter spaces of polynomials. The theory of core…
In this paper, we define the core entropy for postcritically-finite Newton maps and study its continuity within this family. We show that the entropy function is not continuous in this family, which is different from the polynomial case…
A study of real quadratic maps with real critical points, emphasizing the effective construction of critically finite maps with specified combinatorics. We discuss the behavior of the Thurston algorithm in obstructed cases, and in one…
In this paper we will modify the Milnor--Thurston map, which maps a one dimensional mapping to a piece-wise linear of the same entropy, and study its properties. This will allow us to give a simple proof of monotonicity of topological…
This note will describe an effective procedure for constructing critically finite real polynomial maps with specified combinatorics.
We construct an analogue of W. Thurston's "Master teapot" for each principal vein in the Mandelbrot set, and generalize geometric properties known for the corresponding object for real maps. In particular, we show that eigenvalues outside…
In this paper we discuss two different existing algorithms for computing topological entropy and we perform one of them in order to compute the isentropes for cubic polynomials.
A Thurston map is a branched covering map $f\colon S^2\to S^2$ that is postcritically finite. Mating of polynomials, introduced by Douady and Hubbard, is a method to geometrically combine the Julia sets of two polynomials (and their…
Topological mating is an combination that takes two same-degree polynomials and produces a new map with dynamics inherited from this initial pair. This process frequently yields a map that is Thurston-equivalent to a rational map $F$ on the…
We give an effective method to compute the entropy for polynomials orthogonal on a segment of the real axis that uses as input data only the coefficients of the recurrence relation satisfied by these polynomials. This algorithm is based on…
Thurston's Master Teapot is a geometric object that encodes the entropies of critically periodic unimodal maps. We establish the connection between this object and the "Mandelbrot set" of graph directed iterated function systems previously…
This paper studies polynomials with core entropy zero. We give several characterizations of polynomials with core entropy zero. In particular, we show that a degree d post-critically finite polynomial f has core entropy zero if and only if…
We introduce a canonical notion of entropy for polynomials analogue to that of random variables in probability. We prove that entropy increases smoothly with respect to finite free addition. In particular we get the new inequality : $…
We define the (dynamical) core of a topological polynomial (and the associated lamination). This notion extends that of the core of a unimodal interval map. Two explicit descriptions of the core are given: one related to periodic objects…
Expanding Thurston maps were introduced by M. Bonk and D. Meyer with motivation from complex dynamics and Cannon's conjecture from geometric group theory via Sullivan's dictionary. In this paper, we show that the entropy map of an expanding…
In \cite{Mil}, Milnor posed the {\em Monotonicity Conjecture} that the set of parameters within a family of real multimodal polynomial interval maps, for which the topological entropy is constant, is connected. This conjecture was proved…
The main result of this paper is a proof using real analysis of the monotonicity of the topological entropy for the family of quadratic maps, sometimes called Milnor's Monotonicity Conjecture. In contrast, the existing proofs rely in one…
Sparsity and entropy are pillar notions of modern theories in signal processing and information theory. However, there is no clear consensus among scientists on the characterization of these notions. Previous efforts have contributed to…
We compute the polynomial entropy of the induced maps on hyperspace for a homeomorphism $f$ of an interval or a circle with finitely many non-wandering points.