arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1304.4985math.ATcs.CGmath.OC
收藏

非全么模中和单纯复形

Non Total-Unimodularity Neutralized Simplicial Complexes

Bala Krishnamoorthy, Gavin Smith

摘要:

给定一个单纯复形K,其单形上有权,单形上有链,最优同态链问题(OHCP)是寻找一个与给定链同调(在整数上)的权最小的链。OHCP是NP完全的,但如果K的边界矩阵是全么模(TU)的,则当建模为线性规划(LP)时,它在多项式时间内可解。我们在单纯复形上定义了一个条件,称为非全么模中性化,或NTU中性化,这确保了即使当边界矩阵不是TU时,OHCP LP也必须包含每个输入链的积分最优顶点。这个条件是K的一个性质,并且与输入链和单形上的权无关。这个条件严格弱于边界矩阵是TU。更有趣的是,在这种情况下,OHCP LP的多面体可能不是整数。尽管如此,对于每个右手边都存在积分最优顶点,即,对于每个输入链。因此,可以在多项式时间内解决比以前认为可能的更大类的OHCP实例。作为特例,我们证明了具有平凡第一同调群的2-复形是NTU中和的。

英文摘要:

Given a simplicial complex K with weights on its simplices and a chain on it, the Optimal Homologous Chain Problem (OHCP) is to find a chain with minimal weight that is homologous (over the integers) to the given chain. The OHCP is NP-complete, but if the boundary matrix of K is totally unimodular (TU), it becomes solvable in polynomial time when modeled as a linear program (LP). We define a condition on the simplicial complex called non total-unimodularity neutralized, or NTU neutralized, which ensures that even when the boundary matrix is not TU, the OHCP LP must contain an integral optimal vertex for every input chain. This condition is a property of K, and is independent of the input chain and the weights on the simplices. This condition is strictly weaker than the boundary matrix being TU. More interestingly, the polytope of the OHCP LP may not be integral under this condition. Still, an integral optimal vertex exists for every right-hand side, i.e., for every input chain. Hence a much larger class of OHCP instances can be solved in polynomial time than previously considered possible. As a special case, we show that 2-complexes with trivial first homology group are guaranteed to be NTU neutralized.

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

↑