Geometry and combinatorics of Julia sets of real quadratic maps

For real a correspondence is made between the Julia setB forz(z–)², in the hyperbolic case, and the set of-chains±(±(±..., with the aid of Cremer's theorem. It is shown how a number of features ofB can be understood in terms of-chains. The structure ofB is determined by certain equivalence classes of-chains, fixed by orders of visitation of certain real cycles; and the bifurcation history of a given cycle can be conveniently computed via the combinatorics of-chains. The functional equations obeyed by attractive cycles are investigated, and their relation to-chains is given. The first cascade of period-doubling bifurcations is described from the point of view of the associated Julia sets and-chains. Certain Julia sets associated with the Feigenbaum function and some theorems of Lanford are discussed.Supported by NSF grant No. MCS-8104862.Supported by NSF grant No. MCS-8203325.