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

Epsilon-Distortion Complexity for Cantor Sets

C. Bonanno, J. -R. Chazottes, P. Collet

英文摘要:

We define the epsilon-distortion complexity of a set as the shortest program, running on a universal Turing machine, which produces this set at the precision epsilon in the sense of Hausdorff distance. Then, we estimate the epsilon-distortion complexity of various central Cantor sets on the line generated by iterated function systems (IFS's). In particular, the epsilon-distortion complexity of a C^k Cantor set depends, in general, on k and on its box counting dimension, contrarily to Cantor sets generated by polynomial IFS or random affine Cantor sets.

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

↑