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

同位素纽结与空间三价图的图表的极小生成移动集

Minimal generating sets of moves for diagrams of isotopic knots and spatial trivalent graphs

Carmen Caprau, Bradley Scott

AI总结:

本文扩展Polyak关于纽结与链环图表定向Reidemeister移动极小生成集的研究,新增11个4元素极小生成集并证明共12个为全部可能,还确定空间三价图图表定向Reidemeister型移动的极小生成集含10个移动。

摘要:

Polyak证明了纽结和链环图表的所有定向Reidemeister移动都可由仅包含四个定向Reidemeister移动的集合生成,且少于四个无法生成全部。我们将能共同生成所有其他定向Reidemeister移动的含四个定向Reidemeister移动的集合称为极小生成集。Polyak还证明,包含两个1型、一个2型和一个3型Reidemeister移动的特定集合是所有定向Reidemeister移动的极小生成集。我们扩展Polyak的工作,提供另外11个含4个元素的极小定向Reidemeister移动生成集,并证明这12个集合代表所有可能的极小生成集;同时研究关联带源汇三价顶点的定向空间三价图图表的Reidemeister型移动,证明其极小生成集含10个移动。

英文摘要:

Polyak proved that all oriented versions of Reidemeister moves for knot and link diagrams can be generated by a set of just four oriented Reidemeister moves, and that no fewer than four oriented Reidemeister moves generate them all. We refer to a set containing four oriented Reidemeister moves that collectively generate all of the other oriented Reidemeister moves as a minimal generating set. Polyak also proved that a certain set containing two Reidemeister moves of type 1, one move of type 2, and one move of type 3 form a minimal generating set for all oriented Reidemeister moves. We expand upon Polyak's work by providing an additional eleven minimal, 4-element, generating sets of oriented Reidemeister moves, and we prove that these twelve sets represent all possible minimal generating sets of oriented Reidemeister moves. We also consider the Reidemeister-type moves that relate oriented spatial trivalent graph diagrams with trivalent vertices that are sources and sinks and prove that a minimal generating set of oriented Reidemeister-type moves for spatial trivalent graph diagrams contains ten moves.

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

↑