arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1404.6920math.DS
收藏

全不连通的自相似集的packing测度的可计算性

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

Marta Llorente, Manuel Morán

摘要:

本文给出了一个计算满足SSC的自相似集的packing测度的精确值的算法,并证明了算法收敛于packing测度的值。我们还测试了算法的例子表明,最经常的情况下,算法的准确性和使用它提供的额外信息,以获得某些自相似集的包装措施的公式的可能性。例如,我们能够得到收缩因子在区间$(0,1/3]$内的Sierpinski垫片的填充测度的公式(定理2).

英文摘要:

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]$ (Theorem 2).

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑