结构收敛与代数根
Structural convergence and algebraic roots
AI总结:
本文通过考虑根顶点所属可定义集的大小,证明了在结构收敛框架下,当代数顶点属于有限可定义集时,对应的根序列总是存在,为原问题提供了新视角。
摘要:
结构收敛是由 Nešetřil 和 Ossona de Mendez 提出的图收敛框架,统一了稠密(左)图收敛和 Benjamini-Schramm 收敛。他们提出了一个问题:对于给定的收敛于极限 $L$ 的图序列 $(G_n)$ 和 $L$ 的一个顶点 $r$,是否能找到顶点序列 $(r_n)$,使得以 $r$ 为根的 $L$ 是以 $r_n$ 为根的图 $G_n$ 的极限。Christofides 和 Král' 找到了一个反例,但他们证明了该结论对 $L$ 的几乎所有顶点 $r$ 都成立。我们通过考虑根 $r$ 所属的可定义集的大小,为原问题提供了另一个视角。我们证明,如果 $r$ 是代数顶点(即属于有限可定义集),则根序列 $(r_n)$ 总是存在的。
英文摘要:
Structural convergence is a framework for convergence of graphs by Nešetřil and Ossona de Mendez that unifies the dense (left) graph convergence and Benjamini-Schramm convergence. They posed a problem asking whether for a given sequence of graphs $(G_n)$ converging to a limit $L$ and a vertex $r$ of $L$ it is possible to find a sequence of vertices $(r_n)$ such that $L$ rooted at $r$ is the limit of the graphs $G_n$ rooted at $r_n$. A counterexample was found by Christofides and Král', but they showed that the statement holds for almost all vertices $r$ of $L$. We offer another perspective to the original problem by considering the size of definable sets to which the root $r$ belongs. We prove that if $r$ is an algebraic vertex (i.e. belongs to a finite definable set), the sequence of roots $(r_n)$ always exists.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。