We initiate the study of computing shortest non-separating simple closed curves with some given topological properties on non-orientable surfaces. While, for orientable surfaces, any two non-separating simple closed curves are related by a self-homeomorphism of the surface, and computing shortest such curves has been vastly studied, for non-orientable ones the classification of non-separating simple closed curves up to ambient homeomorphism is subtler, depending on whether the curve is one-sided or two-sided, and whether it is orienting or not (whether it cuts the surface into an orientable one). We prove that computing a shortest orienting (weakly) simple closed curve on a non-orientable combinatorial surface is NP-hard but fixed-parameter tractable in the genus of the surface. In contrast, we can compute a shortest non-separating non-orienting (weakly) simple closed curve with given sidedness in $g^{O(1)}.n\log n$ time, where $g$ is the genus and $n$ the size of the surface. For these algorithms, we develop tools that can be of independent interest, to compute a variation on canonical systems of loops for non-orientable surfaces based on the computation of an orienting curve, and some covering spaces that are essentially quotients of homology covers.
翻译:我们首次研究了在非可定向曲面上计算具有某些给定拓扑性质的最短非分离简单闭曲线的问题。对于可定向曲面,任何两条非分离简单闭曲线都可以通过曲面自同胚相互关联,而计算这类最短曲线已有广泛研究;但对于非可定向曲面,非分离简单闭曲线在环境同胚意义下的分类更为精细,取决于曲线是单侧还是双侧,以及是否具有定向性(即是否将曲面切割为可定向曲面)。我们证明,在非可定向组合曲面上计算最短定向(弱)简单闭曲线是NP难的,但在曲面亏格下具有固定参数可解性。相比之下,我们能在$g^{O(1)}.n\log n$时间内计算出具有给定边性的最短非分离非定向(弱)简单闭曲线,其中$g$为亏格,$n$为曲面大小。针对这些算法,我们开发了可能具有独立价值的工具:基于定向曲线计算非可定向曲面典范环路系统的变体,以及本质上是同调覆盖商的一些覆盖空间。