oalib
Search Results: 1 - 10 of 100 matches for " "
All listed articles are free for downloading (OA Articles)
Page 1 /100
Display every page Item
The warping polynomial of a knot diagram  [PDF]
Ayaka Shimizu
Mathematics , 2011,
Abstract: We introduce the warping polynomial of an oriented knot diagram. In this paper, we characterize the warping polynomial, and define the span of a knot to be the minimal span of the warping polynomial for all diagrams of the knot. We show that the span of a knot is one if and only if it is non-trivial and alternating, and we give an inequality between the span and the dealternating number.
The warping matrix of a knot diagram  [PDF]
Ayaka Shimizu
Mathematics , 2015,
Abstract: We introduce the warping matrix which is a new description of oriented knots from a viewpoint of warping degree.
The warping degree of a link diagram  [PDF]
Ayaka Shimizu
Mathematics , 2009,
Abstract: 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 number, and the splitting number.
The rank of a warping matrix  [PDF]
Taira Akiyama,Ayaka Shimizu,Ryohei Watanabe
Mathematics , 2015,
Abstract: The warping matrix has been defined for knot projections and knot diagrams by using warping degrees. In particular, the warping matrix of a knot diagram represents the knot diagram uniquely. In this paper we show that the rank of the warping matrix is one greater than the crossing number. We also discuss the linearly independence of knot diagrams by considering the warping incidence matrix.
Quantization of the crossing number of a knot diagram  [PDF]
Akio Kawauchi,Ayaka Shimizu
Mathematics , 2011,
Abstract: We introduce the warping crossing polynomial of an oriented knot diagram by using the warping degrees of crossing points of the diagram. Given a closed transversely intersected plane curve, we consider oriented knot diagrams obtained from the plane curve as states to take the sum of the warping crossing polynomials for all the states for the plane curve. As an application, we show that every closed transversely intersected plane curve with even crossing points has two independent canonical orientations and every based closed transversely intersected plane curve with odd crossing points has two independent canonical orientations.
Diagram formulas of the Viro-Polyak type for finit degree invariants  [PDF]
Svetlana D. Tyurina
Mathematics , 1999,
Abstract: Vassiliev's knot invariants can be computed in different ways but many of them as Kontsevich integral are very difficult. We consider more visual diagram formulas of the type Polyak-Viro and give new diagram formula for the two basic Vassiliev invariant of degree 4.
On a move reducing the genus of a knot diagram  [PDF]
Kenji Daikoku,Keiichi Sakai,Masamichi Takase
Mathematics , 2011, DOI: 10.1512/iumj.2012.61.4666
Abstract: For a knot diagram we introduce an operation which does not increase the genus of the diagram and does not change its representing knot type. We also describe a condition for this operation to certainly decrease the genus. The proof involves the study of a relation between the genus of a virtual knot diagram and the genus of a knotoid diagram, the former of which has been introduced by Stoimenow, Tchernov and Vdovina, and the latter by Turaev recently. Our operation has a simple interpretation in terms of Gauss codes and hence can easily be computer-implemented.
11-colored knot diagram with five colors  [PDF]
Takuji Nakamura,Yasutaka Nakanishi,Shin Satoh
Mathematics , 2015,
Abstract: We prove that any $11$-colorable knot is presented by an $11$-colored diagram where exactly five colors of eleven are assigned to the arcs. The number five is the minimum for all non-trivially $11$-colored diagrams of the knot. We also prove a similar result for any $11$-colorable ribbon $2$-knot.
Knot Cabling and the Degree of the Colored Jones Polynomial II  [PDF]
Efstratia Kalfagianni,Anh T. Tran
Mathematics , 2015,
Abstract: We continue our study of the degree of the colored Jones polynomial under knot cabling started in "Knot Cabling and the Degree of the Colored Jones Polynomial" (arXiv:1501.01574). Under certain hypothesis on this degree, we determine how the Jones slopes and the linear term behave under cabling. As an application we verify Garoufalidis' Slope Conjecture and a conjecture of the authors for cables of a two-parameter family of closed 3-braids called 2-fusion knots.
Explicit formulas for the Vassiliev knot invariants  [PDF]
Svetlana D. Tyurina
Mathematics , 1999,
Abstract: Vassiliev's knot invariants can be computed in different ways but many of them as Kontsevich integral are very difficult. We consider more visual diagram formulas of the type Polyak-Viro and give new diagram formula for the two basic Vassiliev invariant of degree 4.
Page 1 /100
Display every page Item


Home
Copyright © 2008-2017 Open Access Library. All rights reserved.