Rectangular diagrams of surfaces: the basic moves

Ivan Dynnikov, Maxim Prasolov

备注：: 26 pages, 18 figures
发表信息：: Proceedings of the International Geometry Center, Vol. 13 (2020), no. 4, 50-88
DOI：: 10.15673/tmgc.v13i4.1855

英文摘要：

In earlier papers we introduced a representation of isotopy classes of compact surfaces embedded in the three-sphere by so called rectangular diagrams. The formalism proved useful for comparing Legendrian knots. The aim of this paper is to prove a Reidemeister type theorem for rectangular diagrams of surfaces.

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

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

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

继续探索

相关论文

Realizing Exterior Cromwell moves on rectangular diagrams by Reidemeister moves

If a rectangular diagram represents the trivial knot, then it can be deformed into the trivial rectangular diagram with only four edges by a finite sequence of merge operations and exchange operations, without increasing the number of edges, which was shown by I. A. Dynnikov. Using this, Henrich and Kauffman gave an upper bound for the number of Reidemeister moves needed for unknotting a knot diagram of the trivial knot. However, exchange or merge moves on the top and bottom pairs of edges of rectangular diagrams are not considered in the proof. In this paper, we show that there is a rectangul…

2014-03-02math.GT

Unknotting rectangular diagrams of the trivial knot by exchanging moves

If a rectangular diagram represents the trivial knot, then it can be deformed into the rectangular diagram with only two vertical edges by a finite sequence of merge operations and exchange operations, without increasing the number of vertical edges, which was shown by I. A. Dynnikov. We show in this paper that we need no merge operations to deform a rectangular diagram of the trivial knot to one with no crossings.

2013-03-27math.GT

Rectangular Diagrams of Legendrian Graphs

In this paper Legendrian graphs in $(\mathbb{R}^3,ξ_{\mathrm{st}})$ are considered modulo Legendrian isotopy and edge contraction. To a Legendrian graph we associate a (generalized) rectangular diagram --- a purely combinatorial object. Moves of rectangular diagrams are introduced so that equivalence classes of Legendrian graphs and rectangular diagrams coincide. Using this result we prove that the classes of Legendrian graphs are in one-to-one correspondence with fence diagrams modulo fence moves introduced by Rudolph.

2014-12-06math.GT

Rectangular diagrams of surfaces: distinguishing Legendrian knots

In an earlier paper we introduced rectangular diagrams of surfaces and showed that any isotopy class of a surface in the three-sphere can be presented by a rectangular diagram. Here we study transformations of those diagrams and introduce moves that allow transition between diagrams representing isotopic surfaces. We also introduce more general combinatorial objects called mirror diagrams and various moves for them that can be used to transform presentations of isotopic surfaces to each other. The moves can be divided into two types so that, vaguely speaking, type~I moves commute with type~II …

2021-03-29math.GT

Rectangular knot diagrams classification with deep learning

In this article we discuss applications of neural networks to recognising knots and, in particular, to the unknotting problem. One of motivations for this study is to understand how neural networks work on the example of a problem for which rigorous mathematical algorithms for its solution are known. We represent knots by rectangular Dynnikov diagrams and apply neural networks to distinguish a given diagram class from the given finite families of topological types. The data presented to the program is generated by applying Dynnikov moves to initial samples. The significance of using these diag…

2020-11-06math.GT

Multiflypes of rectangular diagrams of links

We introduce a new very large family of transformations of rectangular diagrams of links that preserve the isotopy class of the link. We provide an example when two diagrams of the same complexity are related by such a transformation and are not obtained from one another by any sequence of `simpler' moves not increasing the complexity of the diagram along the way.

2020-09-04math.GT

更多相关论文收起更多论文

Rectangular diagrams of surfaces: representability

We introduce a simple combinatorial way, which we call a rectangular diagram of a surface, to represent a surface in the three-sphere. It has a particularly nice relation to the standard contact structure on $\mathbb S^3$ and to rectangular diagrams of links. By using rectangular diagrams of surfaces we are going, in particular, to develop a method to distinguish Legendrian knots. This requires a lot of technical work of which the present paper addresses only the first basic question: which isotopy classes of surfaces can be represented by a rectangular diagram. Vaguely speaking the answer is …

2017-01-25math.GT