Abstract

OF THE DISSERTATION Hausdorff Dimension of Invariant Sets and Positive Linear Operators by Amit Priyadarshi Dissertation Director: Roger D. Nussbaum In this thesis we obtain theorems which give the Hausdorff dimension of the invariant set for a family of contraction mappings on a complete, perfect metric space. We obtain results for the graph-directed systems similar to that of Mauldin and Williams [17] but for more general contraction mappings which are “infinitesimal similitudes” rather than just “similitudes”. Also the underlying spaces are not assumed to be finite dimensional. For finite graph-directed systems our results are valid on any bounded, complete, perfect metric space. We use the theory of positive linear operators and generalizations of the Krein-Rutman theorem to characterize the Hausdorff dimension as the unique value of σ > 0 for which r(Lσ) = 1, where Lσ, σ > 0, is a naturally associated family of positive linear operators and r(Lσ) denotes the spectral radius of Lσ. We also obtain theorems for infinite graph-directed systems (with finitely many vertices and countably many edges) on compact, perfect metric spaces. In this case too we have a family of positive linear operators Lσ for σ > σ0 > 0, and the Hausdorff dimension of the invariant set is given by the infimum of σ > σ0 for which r(Lσ) < 1. We discuss an infinte iterated function system given by complex continued fractions and obtain lower bound for the Hausdorff dimension of the invariant set. Our estimate improves the lower bound to 1.787 from 1.2484 obtained in [16]. Finally we also give a theorem

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.