Sergei Chmutov
Recently N.A'Campo suggested a construction of a link from a generic immersion of a curve into a 2-disk. It is tightly related to the singularity theory. In this paper, we give a simple procedure to draw a diagram of the link from a picture of the curve.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
Divides with cusps, shadows, and transvergent diagrams
本文引入了带微光的除数这一推广，并提供了对称链环的横贯图与带尖点除数之间的双向转换算法，同时刻画了自由2-周期链环。
Divides with cusps and symmetric links
本文推广了 A'Campo 的除数概念，引入带尖点的除数并在 S^3 中定义其关联链接，刻画了此类链接，并证明了所有强可逆链接和 2-周期链接均可表示为带尖点除数的链接。
In the present paper we determine the Thurston-Bennequin invariant of graph divide links, which include all closed positive braids, all divide links and certain negative twist knots. As a corollary of this and a result of P. Lisca and A.I. Stipsicz, we prove that the 3-manifold obtained from the 3-sphere by Dehn surgery along a non-trivial graph divide knot K with coefficient r carries positive, tight contact structures for every r except the Thurston-Bennequin invariant of K.
The complement of a complexified real line arrangement is an affine surface. It is classically known that such a space has a handle decomposition up to $2$-handles. We will describe the handle decomposition induced from Lefschetz hyperplane section theorem for such a space. To describe the Kirby diagram, we introduce the notion of the divide with cusps which is a generalization of the divide introduced by A'Campo.
The primary objects of study in the ``knot theory of complex plane curves'' are C-links: links (or knots) cut out of a 3-sphere in the complex plane by complex plane transverse and totally tangential. Transverse C-links are naturally oriented. There are many natural classes of examples: links of singularities; links at infinity; links of divides, free divides, tree divides, and graph divides; and--most generally--quasipositive links. Totally tangential C-links are unoriented but naturally framed; they turn out to be precisely the real-analytic Legendrian links, and can profitably be investigat…
Starting from a divide, i.e. a generic immersion of finitely many copies of the interval [0,1] in the disk, we construct a classical link in the 3-sphere. We prove that the link's complement fibers over the circle, if the divide is connected. Moreover, we compute the monodromy diffeomorphism from the combinatorics of the divide. We added to this version of the paper the theorem about the gordian number of the link of a divide. The gordian number of the link of a divide equals the number of double points of the divide.
Divides and hyperbolic volumes
本文揭示了分割链环理论中的双曲结构，证明分割链环补空间可由分解为理想正四面体、正八面体和立方八面体的双曲3-流形经Dehn填充得到，并由此给出渐近精确的双曲体积上界。
A divide is a relative generic immersion of a finite union of copies of the unit interval in the unit disk. A divide defines a classical link in the 3- sphere, which is a fibered link if the image of the immersion is connected. We prove in this paper, that the Lefschetz number of the monodromy is 0. This result was known for divides, which correspond to real morsifications of complexe plane curve singularities. The proof uses the space of gradient lines of a morse function.
We give a method for constructing a shadowed polyhedron from a divide. The 4-manifold reconstructed from a shadowed polyhedron admits the structure of a Lefschetz fibration if it satisfies a certain property, which we call the LF-property. We will show that the shadowed polyhedron constructed from a divide satisfies this property and the Lefschetz fibration of this polyhedron is isomorphic to the Lefschetz fibration of the divide. Furthermore, applying the same technique to certain free divides we will show that the links of those free divides are fibered with positive monodromy.
We show how to encode a Weinstein 4-manifold using a multisection diagram with divides, which is a sequence of cut systems on a surface, together with a separating collection of curves. We give two algorithms to construct a multisection diagram with divides of a given Weinstein manifold, one starting with a Kirby-Weinstein handle decomposition and one starting with a positive, allowable Lefschetz fibration (PALF). Through the connections with PALFs, we define a monodromy of a multisection and show how to symplectically carry out monodromy substitution on multisections with divides.
Jin and Lee proved the following: Suppose that $D_1, \dots, D_n$ are link diagrams. Given a link $L$ which is partitioned into sublinks $L_1, \dots, L_n$ admitting diagrams $D_1, \dots, D_n$ respectively, there is a diagram $D$ of $L$ whose restrictions to $L_1, \dots, L_n$ are isotopic to $D_1, \dots, D_n$, respectively. In this paper we show that a similar result does hold for welded links and does not for virtual links.
A virtual link diagram is called normal if the associated abstract link diagram is checkerboard colorable, and a virtual link is normal if it has a normal diagram as a representative.In this paper, we introduce a method of converting a virtual link diagram to a normal virtual link diagram by use of the double covering technique. We show that the normal virtual link diagrams obtained from two equivalent virtual link diagrams are related by generalized Reidemeister moves and Kauffman flypes.
A virtual link diagram is called normal if the associated abstract link diagram is checkerboard colorable, and a virtual link is normal if it has a normal diagram as a representative. Normal virtual links have some properties similar to classical links.In this paper, we introduce a method of converting a virtual link diagram to a normal virtual link diagram. We show that the normal virtual link diagrams obtained by this method from two equivalent virtual link diagrams are equivalent. We discuss the relationship between this method and some invariants of virtual links.
Decompositions and diagrams of symplectic surfaces in Weinstein domains
本文引入组合与图示方法研究4维Weinstein区域中的辛曲面，关联其多种分解并构造分支覆盖，证明紧Weinstein区域容许带划分的双截面。
A link homology is defined that is independent of link diagrams. This diagramless homology is closely related to Khovanov homology.
A virtual link diagram is called mod $m$ almost classical if it admits an Alexander numbering valued in integers modulo $m$, and a virtual link is called mod $m$ almost classical if it has a mod $m$ almost classical diagram as a representative. In this paper, we introduce a method of constructing a mod $m$ almost classical virtual link diagram from a given virtual link diagram, which we call an $m$-fold cyclic covering diagram. The main result is that $m$-fold cyclic covering diagrams obtained from two equivalent virtual link diagrams are equivalent. Thus we have a well-defined map from the se…
We classify link diagrams with Turaev genus one and two in terms of an alternating tangle structure of the link diagram. The proof involves surgery along simple closed curves on the Turaev surface, called cutting loops, which have corresponding cutting arcs that are visible on the planar link diagram. These also provide new obstructions for a link diagram on a surface to come from the Turaev surface algorithm.
By using the cohomology theory of quandles, quandle cocycle invariants and shadow quandle cocycle invariants are defined for oriented links and surface-links via broken surface diagrams. By using symmetric quandles, symmetric quandle cocycle invariants are also defined for unoriented links and surface-links via broken surface diagrams. A marked graph diagram is a link diagram possibly with $4$-valent vertices equipped with markers. S. J. Lomonaco, Jr. and K. Yoshikawa introduced a method of describing surface-links by using marked graph diagrams. In this paper, we give interpretations of these…
We prove that a virtual link diagrams satisfying two conditions on the Khovanov homology is minimal, that is, there is no virtual diagram representing the same link with smaller number of crossings. This approach works for both classical and virtual links
It is well known that surface-links in 4-space can be presented by diagrams on the plane of 4-valent spatial graphs with makers on the vertices, called marked graph diagrams. In this paper we extend the method of presenting surface-links by marked graph diagrams to presenting immersed surface-links. We also give some moves on marked graph diagrams that preserve the ambient isotopy classes of their presenting immersed surface-links.
Divide knots and links, defined by A'Campo in the singularity theory of complex curves, is a method to present knots or links by real plane curves. The present paper is a continuation of the author's previous result that every knot in the major subfamilies of Berge's lens space surgery (i.e., knots yielding a lens space by Dehn surgery) is presented by an L-shaped curve as a divide knot. In the present paper, L-shaped curves are generalized and it is shown that every knot in the minor subfamilies, called sporadic examples, of Berge's lens space surgery is presented by a generalized L-shaped cu…
A marked graph diagram is a link diagram possibly with marked $4$-valent vertices. S. J. Lomonaco, Jr. and K. Yoshikawa introduced a method of representing surface-links by marked graph diagrams. Specially, K. Yoshikawa gave local moves on marked graph diagrams, nowadays called Yoshikawa moves. It is now known that two marked graph diagrams representing equivalent surface-links are related by a finite sequence of these Yoshikawa moves. In this paper, we provide some generating sets of Yoshikawa moves on marked graph diagrams representing unoriented surface-links, and also oriented surface-link…
Every link in the 3-sphere has a projection to the plane where the only singularities are pairwise transverse triple points. The associated diagram, with height information at each triple point, is a triple-crossing diagram of the link. We give a set of diagrammatic moves on triple-crossing diagrams analogous to the Reidemeister moves on ordinary diagrams. The existence of n-crossing diagrams for every n>1 allows the definition of the n-crossing number. We prove that for any nontrivial, nonsplit link, other than the Hopf link, its triple-crossing number is strictly greater than its quintuple-c…
In the classical knot theory there is a well-known notion of descending diagram. From an arbitrary diagram one can easily obtain, by some crossing changes, a descending diagram which is a diagram of the unknot or unlink. In this paper the notion of descending diagram for knots and links in the real space is extended to the case of nonoriented knots and links in the projective space. It is also shown that this notion cannot be extended to oriented links.
Shimizu introduced a region crossing change unknotting operation for knot diagrams. As extensions, two integral region choice problems were proposed and the existences of solutions of the problems were shown for all non-trivial knot diagrams by Ahara and Suzuki, and Harada. We relate both integral region choice problems with an Alexander numbering for regions of a link diagram, and give alternative proofs of the existences of solutions for knot diagrams. We also discuss the problems on link diagrams. For each of the problems on the diagram of a two-component link, we give a necessary and suffi…
The hyperbolic volume of a link complement is known to be unchanged when a half-twist is added to a link diagram, and a suitable 3-punctured sphere is present in the complement. We generalize this to the simplicial volume of link complements by analyzing the corresponding toroidal decompositions. We then use it to prove a refined upper bound for the volume in terms of twists of various lengths for links.
We prove a Kauffman-Murasugi-Thistlethwaite theorem for alternating links in thickened surfaces. It states that any reduced alternating diagram of a link in a thickened surface has minimal crossing number, and any two reduced alternating diagrams of the same link have the same writhe. This result is proved more generally for link diagrams that are adequate, and the proof involves a two-variable generalization of the Jones polynomial for surface links defined by Krushkal. The main result is used to establish the first and second Tait conjectures for links in thickened surfaces and for virtual l…
A. S. Lipson constructed two state models yielding the same classical link invariant obtained from the Kauffman polynomial $F(a,z)$. In this paper, we apply Lipson's state models to marked graph diagrams of surface-links, and observe when they induce surface-link invariants.
We determine the minimal number of colors for non-trivial $\mathbb{Z}$-colorings on the standard minimal diagrams of $\mathbb{Z}$-colorable torus links. Also included are complete classifications of such $\mathbb{Z}$-colorings and of such $\mathbb{Z}$-colorings by only four colors, which are shown by using rack colorings on link diagrams.
Rigid and shaky hard link diagrams
本研究将硬图分为刚性硬图和晃动硬图，证明每个链环存在刚性硬图并给出交叉数上限，同时证明平凡结和平凡链环存在晃动硬图。
In paper "A new twist on Lorenz links" (Journal of Topology 2(2009), 227-248) Joan Birman and Ilya Kofman prove the coincidence of the class of Lorenz links and the class of twisted links. The proof in that work is algebraic. We will identify this class in terms of grid diagrams and provide a transparent geometric argument for Birman-Kofman's result.
In the present paper we bring together minimality conditions proposed in previous two papers and present some new minimality conditions for classical and virtual knots and 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.
The OU number and Reidemeister moves of type III for link diagrams
本文提出OU数和非自OU序列，用于确定链接图之间III型Reidemeister移动的下界。
We describe a new class of minimal link diagrams. This class includes certain alternating diagrams, the standard diagrams of all torus links, and numerous homogeneous diagrams whose minimality has not been proven before. Besides, we describe a new larger class of link diagrams with the least number of Seifert circles among all diagrams of a given link. Our approach refers to the Morton-Franks-Williams inequality.
It was shown that any $\mathbb{Z}$-colorable link has a diagram which admits a non-trivial $\mathbb{Z}$-coloring with at most four colors. In this paper, we consider minimal numbers of colors for non-trivial $\mathbb{Z}$-colorings on minimal diagrams of $\mathbb{Z}$-colorable links. We show, for any positive integer $N$, there exists a minimal diagram of a $\mathbb{Z}$-colorable link such that any $\mathbb{Z}$-coloring on the diagram has at least $N$ colors. On the other hand, it is shown that certain $\mathbb{Z}$-colorable torus links have minimal diagrams admitting $\mathbb{Z}$-colorings wit…
This paper has been withdrawn by the author, due to a significant error in section 4.3.1.
This report lists the link diagrams in S^3 for all principal congruence link complements for which such a link diagram is known. Several unpublished link diagrams are included. Related to this, we also include one link diagram for an arithmetic regular tessellation link complement.
Plane curve singularities via divides
该综述梳理 divides 理论如何以 Dehn 扭转显式构造纤维化链环，并阐明其与复孤立平面曲线奇点的 Milnor 纤维化、单值群及消没闭链之间的拓扑联系。
Widths of links via diagram colorings
本研究通过链环图着色定义链环不变量，证明其与标准Morse函数下的各类链环宽度概念一致，该方法算法化且易编程实现，还计算了万余个14交叉以内链环的最大宽度。
In this paper we study the relation between two diagrammatic representations of links in lens spaces: the disk diagram and the grid diagram and we find how to pass from one to the other. We also investigate whether the HOMFLY-PT invariant and the Link Floer Homology are essential invariants, that is, we try to understand if these invariants are able to distinguish links in $L(p,q)$ covered by the same link in $\mathbf{S}^3$. In order to do so, we generalize the combinatorial definition of Knot Floer Homology in lens spaces to the case of links and we analyze how both the invariants change when…
On link diagrams that are minimal with respect to Reidemeister moves I and II
本文定义了关于Reidemeister move I和II极小的链环图，证明了无平凡分离分支链环的极小图及其交叉点数唯一，并探讨了Reidemeister move III对极小图的作用。
We define an equivalence relation on graphs with signed edges, such that the associated adjacency matrices of two equivalent graphs are congruent over $\mathbb{Z}$. We show that signed graphs whose eigenvalues are larger than $-2$ are equivalent to one of the simply laced Dynkin diagrams: $A_{n}$, $D_{n}$, $E_{6}$, $E_{7}$ and $E_{8}$. Checkerboard graph links are a class of fibred strongly quasipositive links which include positive braid links. We use the previous result to prove that a checkerboard graph link with maximal signature is isotopic to one of the links realized by the simply laced…
In this paper we formalize a combinatorial object for describing link diagrams called a Planar Diagram Code. PD-codes are used by the KnotTheory Mathematica package developed by Bar-Natan, et al. We present the set of PD-codes as a stand alone object and discuss its relationship with link diagrams. We give an explicit algorithm for reconstructing a knot diagram on a surface from a PD-code. We also discuss the intrinsic symmetries of PD-codes (i.e., invertibility and chirality). The moves analogous to the Reidemeister moves are also explored, and we show that the given set of PD-codes modulo th…
To a rational homology sphere graph manifold one can associate a weighted tree invariant called splice diagram. In this article we prove a sufficient numerical condition on the splice diagram for a graph manifold to be a singularity link. We also show that if two manifolds have the same splice diagram, then their universal abelian covers are homeomorphic. To prove the last theorem we have to generalize our notions to orbifolds.
Equivalence of flat-virtual diagrams
本研究聚焦于作为加厚曲面中链环映射像的平坦虚拟图，探究其等价性与不变量，为利用平坦虚拟链环不变量构建链环不变量提供支撑。
For an oriented virtual link, L.H. Kauffman defined the f-polynomial (Jones polynomial). The supporting genus of a virtual link diagram is the minimal genus of a surface in which the diagram can be embedded. In this paper we show that the span of the f-polynomial of an alternating virtual link L is determined by the number of crossings of any alternating diagram of L and the supporting genus of the diagram. It is a generalization of Kauffman-Murasugi-Thistlethwaite's theorem. We also prove a similar result for a virtual link diagram that is obtained from an alternating virtual link diagram by …
Combinatorial link concordance using cut-diagrams
引入切割图概念，定义切割同痕关系，证明一维切割图的幂零周边系统是切割同痕不变量，并给出Stallings定理的组合版本。
In this paper, we define the set of singular grid diagrams $\mathcal{SG}$ which provides a unified description for singular links, singular Legendrian links, singular transverse links, and singular braids. We also classify the complete set of all equivalence relations on $\mathcal{SG}$ which induce the bijection onto each singular object. This is an extension of the known result of Ng-Thurston for non-singular links and braids.
By adding or removing appropriate structures to Gauss diagram, one can create useful objects related to virtual links. In this paper few objects of this kind are studied: twisted virtual links generalizing virtual links; signed chord diagrams staying halfway between twisted virtual links and Kauffman bracket / Khovanov homology; alternatable virtual links intermediate between virtual and classical links. The most profound role here belongs to a structure that we dare to call orientation of chord diagram. Khovanov homology is generalized to oriented signed chord diagrams and links in oriented t…
Virtual knot theory is a generalization of knot theory which is based on Gauss chord diagrams and link diagrams on closed oriented surfaces. A twisted knot is a generalization of a virtual knot, which corresponds to a link diagram on a possibly non-orientable surface. In this paper, we discuss an invariant of twisted links which is obtained from the JKSS invariant of virtual links by use of double coverings. We also discuss some properties of double covering diagrams.
Characterization of non-self OU sequences of two-component link diagrams
本文研究了非自OU序列能提取的信息，并完全特征化了两组分链接图中非自OU序列的配对，特别针对交叉数不超过五的素链接进行了具体特征化。
We give a simple example showing that a knot or link diagram that lies in the ${\mathbb{Z}}^2$ lattice is not necessarily the projection of a lattice stick knot or link in the ${\mathbb{Z}}^3$ lattice, and we give a necessary and sufficient condition for when a knot or link diagram that lies in the ${\mathbb{Z}}^2$ lattice is in fact the projection of a lattice stick knot or link.
We describe a model of random links based on random 4-valent maps, which can be sampled due to the work of Schaeffer. We will look at the relationship between the combinatorial information in the diagram and the hyperbolic volume. Specifically, we show that for random alternating diagrams, the expected hyperbolic volume is asymptotically linear in the number of crossings. For nonalternating diagrams, we compute the probability of finding a given, arbitrary tangle around a given crossing, and show that a random link diagram will be highly composite. Additionally, we present some results of comp…
Parallelization of Welded Links
本文提出了一种焊接链接图的并行化构造，展示了其等价性，并探讨了其在棋盘着色和非分裂条件中的应用。
We introduce an up-down coloring of a virtual-link diagram. The colorabilities give a lower bound of the minimum number of Reidemeister moves of type II which are needed between two 2-component virtual-link diagrams. By using the notion of a quandle cocycle invariant, we determine the necessity of Reidemeister moves of type II for a pair of diagrams of the trivial virtual-knot. This implies that for any virtual-knot diagram $D$, there exists a diagram $D'$ representing the same virtual-knot such that any sequence of generalized Reidemeister moves between them includes at least one Reidemeister…
Virtual Multicrossings and Petal Diagrams for Virtual Knots and Links
本文将经典纽结的多重交叉概念推广至虚拟纽结与链环，并证明所有虚拟纽结均存在花瓣图。
Given a virtual link diagram $D$, we define its unknotting index $U(D)$ to be minimum among $(m, n)$ tuples, where $m$ stands for the number of crossings virtualized and $n$ stands for the number of classical crossing changes, to obtain a trivial link diagram. By using span of a diagram and linking number of a diagram we provide a lower bound for unknotting index of a virtual link. Then using warping degree of a diagram, we obtain an upper bound. Both these bounds are applied to find unknotting index for virtual links obtained from pretzel links by virtualizing some crossings
For an oriented link diagram D, the warping degree d(D) is the smallest number of crossing changes which are needed to obtain a monotone diagram from D. We show that d(D)+d(-D)+sr(D) is less than or equal to the crossing number of D, where -D denotes the inverse of D and sr(D) denotes the number of components which have at least one self-crossing. Moreover, we give a necessary and sufficient condition for the equality. We also consider the minimal d(D)+d(-D)+sr(D) for all diagrams D. For the warping degree and linking warping degree, we show some relations to the linking number, unknotting num…
A realization of a virtual link diagram is obtained by choosing over/under markings for each virtual crossing. Any realization can also be obtained from some representation of the virtual link. (A representation of a virtual link is a link diagram on an oriented 2-dimensional surface.) We prove that if a minimal genus representation meets certain criteria then there is a minimal genus representation resulting in a knotted realization.
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。