连通广义Sierpinski地毯的割点的存在性
On the existence of cut points of connected generalized Sierpinski carpets
摘要:
在以前的工作联合戴和罗,我们表明,一个连接的广义Sierpienski地毯(或简称GSC)有割点当且仅当相关的$n$ -th哈达图有一个长尾的所有$n\geq 2$。在本文中,我们推广了上述结果,证明了它足以检查有限个这些图,以得出一个结论。该标准提供了一个真正的“算法”解决方案的割点问题的连接GSC。我们还为每个$m\geq 1$构建了一个连接的GSC与$m$割点,并证明了当$m\geq 2$,这样的GSC必须是所谓的脆弱型。
英文摘要:
In a previous work joint with Dai and Luo, we show that a connected generalized Sierpiński carpet (or shortly a GSC) has cut points if and only if the associated $n$-th Hata graph has a long tail for all $n\geq 2$. In this paper, we extend the above result by showing that it suffices to check a finite number of those graphs to reach a conclusion. This criterion provides a truly "algorithmic" solution to the cut point problem of connected GSCs. We also construct for each $m\geq 1$ a connected GSC with exactly $m$ cut points and demonstrate that when $m\geq 2$, such a GSC must be of the so-called fragile type.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。