无限Sierpinski地毯图的同构分类
Isomorphism classification of infinite Sierpinski carpet graphs
摘要:
对于每一个无限字在一个给定的有限字母表,我们定义一个递增序列的根有限图,可以被认为是著名的谢尔宾斯基地毯的近似。这些序列自然地收敛到一个无限根极限图。我们表明,有无数类的同构,这样的极限图,被视为无根图。
英文摘要:
For each infinite word over a given finite alphabet, we define an increasing sequence of rooted finite graphs, that can be thought as approximations of the famous Sierpinski carpet. These sequences naturally converge to an infinite rooted limit graph. We show that there are uncountably many classes of isomorphism of such limit graphs, regarded as unrooted graphs.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。