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

线性时间中映射的自同构群

Automorphism groups of maps in linear time

Ken-ichi Kawarabayashi, Bojan Mohar, Roman Nedela, Peter Zeman

摘要:

通过映射,我们指的是闭合致密表面的$2$ -胞腔剖分,即,图的嵌入使得每个面都同胚于一个开圆盘。映射的自同构可以被认为是顶点的置换,其在嵌入中保持顶点-边-面关联。当基础曲面是可定向的时,映射的每一个自同构决定曲面的一个保角同胚。虽然它是没有“真正的次二次”算法测试地图同构的无约束属,我们提出了一个线性时间算法计算的生成元的自同构群的地图,参数化的基础表面的属。该算法应用一系列的局部约简,并产生一个统一的地图,同时保持自同构群。原映射的自同构群可以在线性时间内由一致映射的自同构群重构。我们还利用对映双覆盖将算法推广到非可定向曲面。

英文摘要:

By a map we mean a $2$-cell decomposition of a closed compact surface, i.e., an embedding of a graph such that every face is homeomorphic to an open disc. Automorphism of a map can be thought of as a permutation of the vertices which preserves the vertex-edge-face incidences in the embedding. When the underlying surface is orientable, every automorphism of a map determines an angle-preserving homeomorphism of the surface. While it is conjectured that there is no "truly subquadratic" algorithm for testing map isomorphism for unconstrained genus, we present a linear-time algorithm for computing the generators of the automorphism group of a map, parametrized by the genus of the underlying surface. The algorithm applies a sequence of local reductions and produces a uniform map, while preserving the automorphism group. The automorphism group of the original map can be reconstructed from the automorphism group of the uniform map in linear time. We also extend the algorithm to non-orientable surfaces by making use of the antipodal double-cover.

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

↑