Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-17T04:49:12.430Z Has data issue: false hasContentIssue false

Computability of the packing measure of totally disconnected self-similar sets

Published online by Cambridge University Press:  06 February 2015

MARTA LLORENTE
Affiliation:
Dpt. Análisis Económico: Economía cuantitativa, Universidad Autónoma de Madrid, Campus de Cantoblanco, 28049 Madrid, Spain email m.llorente@uam.es
MANUEL MORÁN
Affiliation:
Dpt. Análisis Económico I, Universidad Complutense de Madrid, Campus de Somosaguas, 28223 Madrid, Spain email mmoranca@ccee.ucm.es
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We present an algorithm to compute the exact value of the packing measure of self-similar sets satisfying the so called Strong Separation Condition (SSC) and prove its convergence to the value of the packing measure. We also test the algorithm with examples that show both the accuracy of the algorithm for the most regular cases and the possibility of using the additional information provided by it to obtain formulas for the packing measure of certain self-similar sets. For example, we are able to obtain a formula for the packing measure of any Sierpinski gasket with contraction factor in the interval  $(0,\frac{1}{3}]$ .

Information

Type
Research Article
Copyright
© Cambridge University Press, 2015