Regular and limit sets for holomorphic correspondences (Q2717645)

From MaRDI portal





scientific article; zbMATH DE number 1605240
Language Label Description Also known as
English
Regular and limit sets for holomorphic correspondences
scientific article; zbMATH DE number 1605240

    Statements

    Regular and limit sets for holomorphic correspondences (English)
    0 references
    0 references
    0 references
    17 June 2001
    0 references
    holomorphic dynamics
    0 references
    correspondences
    0 references
    regular sets
    0 references
    limit sets
    0 references
    A holomorphic correspondence is a multivalued map \(f\colon \widetilde{Q}_+\circ \widetilde{Q}_-:Z\to W\) where \(\widetilde{Q}_+\colon X\to W\), \(\widetilde{Q}_-\colon X\to Z\) are holomorphic surjective maps between Riemann surfaces. If \(Z=W\), such a correspondence can be iterated. The theory of iteration of holomorphic correspondences covers not only the iteration of rational maps, but also Kleinian groups, as seen by taking \(X\) the union of graphs of a set of generators and \(\widetilde{Q}_+\), \(\widetilde{Q}_-\) the projection maps.NEWLINENEWLINENEWLINEThere is a well-known parallel between iteration of rational maps and Kleinian groups which is illustrated by Sullivan's famous dictionary. In the paper under review, the foundations are laid for a third column to this dictionary which would correspond to holomorphic correspondences. Notions of regular set, limit set, normality and equicontinuity sets are defined. Contrary to the rational case, the last two do not coincide, and the Julia set is defined as the complement of the latter. The authors obtain invariance properties for these sets, and some relations between them, and state some conjectures, e.g. that the boundary of the limit set is a subset of the Julia set.NEWLINENEWLINENEWLINEThe authors also consider the difficult problem of constructing a fundamental domain for the iteration of a correspondence on its regular set, and solve it in a particular case.
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references