Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 28 Apr 2014 in math.DS | (1404.6920v1)

Abstract: We present an algorithm to compute the exact value of the packing measure of self-similar sets satisfying the so called 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 contractio factor in the interval (0,1/3](0,1/3] (Theorem 2).

Citations (9)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.