Hostname: page-component-5db58dd55d-htx7c Total loading time: 0 Render date: 2026-06-06T23:43:44.194Z Has data issue: false hasContentIssue false

Dimensions of random affine code tree fractals

Published online by Cambridge University Press:  30 January 2013

ESA JÄRVENPÄÄ
Affiliation:
Department of Mathematical Sciences, PO Box 3000, 90014 University of Oulu, Finland email esa.jarvenpaa@oulu.fimaarit.jarvenpaa@oulu.fihenna.koivusalo@oulu.fiville.suomala@oulu.fi
MAARIT JÄRVENPÄÄ
Affiliation:
Department of Mathematical Sciences, PO Box 3000, 90014 University of Oulu, Finland email esa.jarvenpaa@oulu.fimaarit.jarvenpaa@oulu.fihenna.koivusalo@oulu.fiville.suomala@oulu.fi
ANTTI KÄENMÄKI
Affiliation:
Department of Mathematics and Statistics, PO Box 35, 40014 University of Jyväskylä, Finland email antti.kaenmaki@jyu.fi
HENNA KOIVUSALO
Affiliation:
Department of Mathematical Sciences, PO Box 3000, 90014 University of Oulu, Finland email esa.jarvenpaa@oulu.fimaarit.jarvenpaa@oulu.fihenna.koivusalo@oulu.fiville.suomala@oulu.fi
ÖRJAN STENFLO
Affiliation:
Department of Mathematics, Uppsala University, PO Box 480, 75106 Uppsala, Sweden email stenflo@math.uu.se
VILLE SUOMALA
Affiliation:
Department of Mathematical Sciences, PO Box 3000, 90014 University of Oulu, Finland email esa.jarvenpaa@oulu.fimaarit.jarvenpaa@oulu.fihenna.koivusalo@oulu.fiville.suomala@oulu.fi

Abstract

We study the dimension of code tree fractals, a class of fractals generated by a set of iterated function systems. We first consider deterministic affine code tree fractals, extending to the code tree fractal setting the classical result of Falconer and Solomyak on the Hausdorff dimension of self-affine fractals generated by a single iterated function system. We then calculate the almost sure Hausdorff, packing and box counting dimensions of a general class of random affine planar code tree fractals. The set of probability measures describing the randomness includes natural measures in random $V$-variable and homogeneous Markov constructions.

Information

Type
Research Article
Copyright
©2013 Cambridge University Press 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable