离散Morse函数在树上的实现问题
The realization problem for discrete Morse functions on trees
摘要:
我们引入了一个新的概念,称为持久性等价图上的离散Morse函数的等价。两个函数被认为是持久性等价的,当且仅当它们导出相同的持久性图。我们比较这个概念的等价性等概念的离散Morse函数。然后,我们计算一个上界的持久性等价的离散莫尔斯函数的数量在一个固定的图形,并表明,这个上界是尖锐的情况下,我们的图是一棵树。这是持久性映射的“实现问题”的一个版本。最后,我们用一个例子来说明我们的建设。
英文摘要:
We introduce a new notion of equivalence of discrete Morse functions on graphs called persistence equivalence. Two functions are considered persistence equivalent if and only if they induce the same persistence diagram. We compare this notion of equivalence to other notions of equivalent discrete Morse functions. We then compute an upper bound for the number of persistence equivalent discrete Morse functions on a fixed graph and show that this upper bound is sharp in the case where our graph is a tree. This is a version of the "realization problem" of the persistence map. We conclude with an example illustrating our construction.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。