Conformal graph directed Markov systems: beyond finite irreducibility (Q329453)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Conformal graph directed Markov systems: beyond finite irreducibility |
scientific article |
Statements
Conformal graph directed Markov systems: beyond finite irreducibility (English)
0 references
21 October 2016
0 references
Summary: In this paper, we study CGDMSs which are not necessarily finitely irreducible. We do this from two different perspectives: by investigating irreducible infinite systems and by examining general (i.e. potentially reducible) finite systems. In this latter case, we derive a necessary and sufficient condition under which the Hausdorff measure of the limit set is positive and finite. We further show that if this condition doesn't hold then the Hausdorff measure, though infinite, is \(\sigma\)-finite. This condition is given in terms of the strongly connected components of the directed graph. We also demonstrate that the pressure and Hausdorff dimension of the limit set are completely determined by the strongly connected components.
0 references
iterated function system
0 references
graph directed Markov system
0 references
Hausdorff dimension
0 references
Hausdorff measure
0 references
0 references
0 references