arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1210.1932math.ATcs.CGmath.AC
收藏

多项式时间可计算的一般多持久性模块的介绍?

A presentation of general multipersistence modules computable in polynomial time?

Antonio Patriarca, Martina Scolamiero, Francesco Vaccarino

摘要:

多持久性同调模是由G.Carlsson和A.Zomorodian提出的,他们与G.Singh一起给出了计算它们的Groebner基的算法。虽然他们的算法在链模块是自由的时具有多项式复杂度,即在一个临界的情况下,它通常可能是指数的。我们给出了一个新的多持久性同调模,这使我们能够设计一个算法来计算它们的Groebner基地总是在多项式时间,避免映射望远镜。

英文摘要:

Multipersistence homology modules were introduced by G.Carlsson and A.Zomorodian which gave, together with G.Singh, an algorithm to compute their Groebner bases. Although their algorithm has polynomial complexity when the chain modules are free, i.e. in the one-critical case, it might be exponential in general. We give a new presentation of multipersistence homology modules, which allows us to design an algorithm to compute their Groebner bases always in polynomial time by avoiding the mapping telescope.

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

↑