论文标题
图形幅度同源性的几何方法
Geometric approach to graph magnitude homology
论文作者
论文摘要
在本文中，我们引入了一种新方法来计算一般图的幅度同源。对于幅度链复合物的每个直接总和成分，我们分配了一对简单络合物，其简单链复合物对其具有同构。首先，我们指出我们的主要定理专门针对树木，这为已知树是对角线的事实提供了另一个证据。在那之后，我们考虑可能具有循环的一般图。我们还将某些计算作为应用程序。
In this paper, we introduce a new method to compute magnitude homology of general graphs. To each direct sum component of magnitude chain complexes, we assign a pair of simplicial complexes whose simplicial chain complex is isomorphic to it. First we states our main theorem specialized to trees, which gives another proof for the known fact that trees are diagonal. After that, we consider general graphs, which may have cycles. We also demonstrate some computation as an application.
