关于3流形的稀疏表示
On Sparse Representations of 3-Manifolds
AI总结:
本文研究通过控制稀疏性参数转换3流形三角化的方法,提出固定参数可解框架计算Kuperberg量子不变量,并设计近线性时间算法减少边阀值,提升流形表示效率。
摘要:
3流形通常用三角化表示,由抽象四面体的三角面配对构成。三角化组合稀疏性(通过对偶图树宽衡量)在参数化算法设计中起关键作用。本文研究转换或修改三角化的同时控制特定稀疏性参数的算法。首先,回顾线性时间算法将三角化转换为3流形Heegaard图,证明构造保持树宽。应用此方法展示固定参数可解框架计算Kuperberg量子不变量。其次,提出近线性时间算法将三角化重新三角化为最大边阀值不超过九的三角化,仅适度增加对偶图树宽。结合两种算法得到近线性时间算法,从给定三角化生成Heegaard图,其中每个连接曲线至多与九个其他曲线相交。
英文摘要:
3-manifolds are commonly represented as triangulations, consisting of abstract tetrahedra whose triangular faces are identified in pairs. The combinatorial sparsity of a triangulation, as measured by the treewidth of its dual graph, plays a fundamental role in the design of parameterized algorithms. In this work, we investigate algorithmic procedures that transform or modify a given triangulation while controlling specific sparsity parameters. First, we revisit a standard, linear-time algorithm that converts a given triangulation into a Heegaard diagram of the underlying 3-manifold, showing that the construction preserves treewidth. We apply this construction to exhibit a fixed-parameter tractable framework for computing Kuperberg's quantum invariants of 3-manifolds. Second, we present a quasi-linear-time algorithm that retriangulates a given triangulation into one with maximum edge valence of at most nine, while only moderately increasing the treewidth of the dual graph. Combining these two algorithms yields a quasi-linear-time algorithm that produces, from a given triangulation, a Heegaard diagram in which every attaching curve intersects at most nine others.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。