A key result in computational 3-manifold topology is that any two triangulations of the same 3-manifold are connected by a finite sequence of bistellar flips, also known as Pachner moves. One limitation of this result is that little is known about the structure of this sequences; knowing more about the structure could help both proofs and algorithms. Motivated by this, we show that there must be a sequence that satisfies a rigid property that we call "semi-monotonicity". We also study this result empirically: we implement an algorithm to find such semi-monotonic sequences, and compare their characteristics to less structured sequences, in order to better understand the practical and theoretical utility of this result.
翻译:计算三维地形的一个关键结果是,同一三维的两种三角图象都由数量有限的双星翻转(又称Pachner动作)连接在一起。这一结果的一个局限性是,对这一序列的结构知之甚少;对结构的更多了解有助于证明和算法。我们为此的动力显示,必须有一个符合我们称之为“半分子性”的僵硬属性的序列。我们还从经验学上研究这一结果:我们采用算法来寻找这种半分子序列,并将这些序列的特点与结构较松的序列进行比较,以便更好地了解这一结果的实际和理论效用。