arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1505.02230cs.CG
收藏

最优Morse函数与$\tilde{O}(N)$时间上的$H(\mathcal{M}^2,\mathbb{A})$

Optimal Morse functions and $H(\mathcal{M}^2,\mathbb{A})$ in $\tilde{O}(N)$ time

Abhishek Rathore

摘要:

在这项工作中,我们设计了一个近似线性时间离散Morse理论为基础的算法计算2-流形的同调群,从而建立一个事实,即计算2-流形的同调群是非常容易的。与以前的算法类似的味道,我们的方法与任意阿贝尔群的系数。我们的方法的另一个优点在于,我们的算法实际上阐明了拓扑原因,使计算2-流形上容易。这是可能的,由于一个新的简单的同伦为基础的建设,被称为\emph{expansion frames}。利用扩张标架得到了最优离散梯度向量场.其次是基于离散Morse边界算子的伪线性时间动态规划计算。最优梯度向量场的有效设计和边界算子的快速计算使我们在同调群的计算中接近线性。此外,我们定义了一个新的标准,称为伪最优性接近最优的Morse函数。一个Morse函数是伪最优的,如果我们可以从它得到一个最优的Morse函数,简单地通过临界单元取消。使用扩展框架,我们建立了一个令人惊讶的事实,即2-流形上的任意离散Morse函数是伪最优的。

英文摘要:

In this work, we design a nearly linear time discrete Morse theory based algorithm for computing homology groups of 2-manifolds, thereby establishing the fact that computing homology groups of 2-manifolds is remarkably easy. Unlike previous algorithms of similar flavor, our method works with coefficients from arbitrary abelian groups. Another advantage of our method lies in the fact that our algorithm actually elucidates the topological reason that makes computation on 2-manifolds easy. This is made possible owing to a new simple homotopy based construct that is referred to as \emph{expansion frames}. To being with we obtain an optimal discrete gradient vector field using expansion frames. This is followed by a pseudo-linear time dynamic programming based computation of discrete Morse boundary operator. The efficient design of optimal gradient vector field followed by fast computation of boundary operator affords us near linearity in computation of homology groups. Moreover, we define a new criterion for nearly optimal Morse functions called pseudo-optimality. A Morse function is pseudo-optimal if we can obtain an optimal Morse function from it, simply by means of critical cell cancellations. Using expansion frames, we establish the surprising fact that an arbitrary discrete Morse function on 2-manifolds is pseudo-optimal.

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

↑