arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 2012.05378math.CO
收藏

图的同伦覆盖

Homotopy Covers of Graphs

Tien Chih, Laura Scull

AI总结:

本文研究非简单图的同伦理论,提出同伦覆盖映射及universal covers概念,推广了简单图的已知结果,探讨了反射图的性质及同伦覆盖的提升性质。

摘要:

我们发展了一种$\times$-同伦、基本群体和覆盖空间的理论,应用于非简单图,推广了简单图的已有结果。我们证明有限图的$\times$-同伦可以分解为调整单个顶点的移动,推广了\cite{CS1}中的蜘蛛引理。我们定义了同伦覆盖映射的概念,发展了universal covers和deck变换的理论,推广了\cites{TardifWroncha, Matsushita}到非简单图。我们探讨了反射图的情况,其中每个顶点至少有一个环。我们还证明这些同伦覆盖映射对任意图同态满足同伦提升性质,推广了\cites{Matsushita, TardifWroncha}中的路径提升结果。

英文摘要:

We develop a theory of $\times$-homotopy, fundamental groupoids and covering spaces that apply to non-simple graphs, generalizing existing results for simple graphs. We prove that $\times$-homotopies from finite graphs can be decomposed into moves which adjust at most one vertex at a time, generalizing the spider lemma of \cite{CS1}. We define a notion of homotopy covering map and develop a theory of universal covers and deck transformations, generalizing \cites{TardifWroncha, Matsushita} to non-simple graphs. We examine the case of reflexive graphs, where each vertex has at least one loop. We also prove that these homotopy covering maps satisfy a homotopy lifting property for arbitrary graph homomorphisms, generalizing path lifting results of \cites{Matsushita, TardifWroncha}.

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

↑