To Define the Core Entropy for All Polynomials Having a Connected Julia Set

Abstract

For all polynomials f with deg(f)2 that have a connected filled Julia set K, we introduce a new quantity h GCE(f), such that h GCE(fn)=n· h GCE(f) for all n1 and h GCE(f)=h GCE(g) for J-equivalent f and g. When the coefficients and the critical points of f are real, h GCE(f)=h(K,f). When f is post-critically finite, h GCE(f) equals the core entropy h(H(f),f), where H(f) is the Hubbard tree. For fc(z)=z2+c with c varying in the Mandelbrot set M, the entropy map c h GCE(fc) is not continuous. However, its lower envelope h core:M→R given by h core(c)=∈f\t:\ ∃\ cn c\ with\ cn→ c\ and\ t=n→∞h GCE(fcn)\ is continuous over M and has three properties. First, every h core-1([0,s]) with s0 is connected. In particular, h core-1(0) coincides with the central molecule. Second, h core(c)=h(R,fc) for c∈[-2,14]. Third, h core(c)=h(H(fc),fc) for post-critically finite fc.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…