arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2407.04837math.CAmath.MG
收藏

自相似集与Lipschitz图

Self-similar sets and Lipschitz graphs

Blair Davey, Silvia Ghinassi, Bobby Wilson

AI总结:

本文研究了自相似集与Lipschitz图的交集问题,证明了一维吸引子的子集可被Lipschitz图覆盖,且Lipschitz常数与维度差有关。

摘要:

我们研究并量化了平面中可测集与纯不可测集之间的区别。即,给定纯不可测集总是与Lipschitz图像没有交集,我们问这些集合是否与Lipschitz图像在接近于一的维度上相交。在回答这个问题时,我们显示了一维的迭代函数系统吸引子,如果满足开放集条件,则具有任意接近于一的维度的子集可以被Lipschitz图覆盖。此外,此类图的Lipschitz常数取决于原始集与与图相交的子集的维度之差。

英文摘要:

We investigate and quantify the distinction between rectifiable and purely unrectifiable 1-sets in the plane. That is, given that purely unrectifiable 1-sets always have null intersections with Lipschitz images, we ask whether these sets intersect with Lipschitz images at a dimension that is close to one. In an answer to this question, we show that one-dimensional attractors of iterated function systems that satisfy the open set condition have subsets of dimension arbitrarily close to one that can be covered by Lipschitz graphs. Moreover, the Lipschitz constant of such graphs depends explicitly on the difference between the dimension of the original set and the subset that intersects with the graph.

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

↑