Renormalization and rigidity of polynomials of higher degree. (Q1411729)

From MaRDI portal
Revision as of 21:38, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Renormalization and rigidity of polynomials of higher degree.
scientific article

    Statements

    Renormalization and rigidity of polynomials of higher degree. (English)
    0 references
    0 references
    2002
    0 references
    Renormalization plays a very important role in the study of the dynamics of quadratic polynomials. In this paper, the author generalizes the renormalization to polynomials of any degree so that a lot of known properties still hold for the generalized renormalization. This generalization has the following form: Let \(f\) be a polynomial of degree \(d\) with connected Julia set and \(c_0\in C(f)\) is a critical point. \(f^n\) is called renormalizable about \(c_0\) if there exist open disks \(U,\,V\in\mathbb{C}\) such that: (1) \(c_0\in U\); (2) \((f^n, U,V)\) is a polynomial-like map with connected filled Julia set; (3) for each \(c\in C(f)\), there is at most one \(i\), \(0< i\leq n\), such that \(c\in f^i(U)\); (4) \(n> 1\) or \(U\not\supset C(f)\). A renormalization is a polynomial-like restriction \((f^n, U,V)\) as above. The main result of this paper is the following: A robust infinitely renormalizable polynomial carries no invariant line field on its Julia set.
    0 references
    renormalizable polynomial
    0 references
    line field
    0 references
    Julia set
    0 references
    robust infinite renormalization
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references