• Kyungpook Mathematical Journal
• /
• v.57 no.1
• /
• pp.145-161
• /
• 2017

If a virtual knot diagram can be transformed to another virtual one by a finite sequence of crossing changes, Reidemeister moves and virtual moves then the two virtual knot diagrams are said to be homotopic. There are infinitely many homotopy classes of virtual knot diagrams. We give necessary conditions by using polynomial invariants of virtual knots for two virtual knots to be homotopic. For a sequence S of crossing changes, Reidemeister moves and virtual moves between two homotopic virtual knot diagrams, we give a lower bound for the number of crossing changes in S by using the affine index polynomial introduced in [13]. In [10], the first author gave the q-polynomial of a virtual knot diagram to find Reidemeister moves of virtually isotopic virtual knot diagrams. We find how to apply Reidemeister moves by using the q-polynomial to show homotopy of two virtual knot diagrams.

• Kyungpook Mathematical Journal
• /
• v.52 no.2
• /
• pp.223-243
• /
• 2012

There is a special connection between the Alexander polynomial of (1, 1)-knot and the certain polynomial associated to the Dunwoody 3-manifold ([3], [10] and [13]). We study the polynomial(called the Dunwoody polynomial) for the (1, 1)-knot obtained by the certain cyclically presented group of the Dunwoody 3-manifold. We prove that the Dunwoody polynomial of (1, 1)-knot in $\mathbb{S}^3$ is to be the Alexander polynomial under the certain condition. Then we find an invariant for the certain class of torus knots and all 2-bridge knots by means of the Dunwoody polynomial.

• Kyungpook Mathematical Journal
• /
• v.49 no.4
• /
• pp.801-809
• /
• 2009

By using a tangle decomposition of a knot, we give a method for the construction of a knot with the lowest trivial HOMFLY coefficient polynomial. Applying this, we show that there exist infinitely many 2-bridge knots with such a coefficient polynomial.

• Kyungpook Mathematical Journal
• /
• v.62 no.2
• /
• pp.347-361
• /
• 2022

Two virtual knot diagrams are said to be equivalent, if there is a sequence S of Reidemeister moves and virtual moves relating them. The difference of writhes of the two virtual knot diagrams gives a lower bound for the number of the first Reidemeister moves in S. In previous work, we introduced a polynomial q_K(t) for a virtual knot diagram K which gave a lower bound for the number of the third Reidemeister moves in the sequence S. In this paper we define a new polynomial from a coloring of a virtual knot diagram. Using this polynomial, we give a lower bound for the number of the second Reidemeister moves in S. The polynomial also suggests the design of the sequence S.

• The Pure and Applied Mathematics
• /
• v.25 no.2
• /
• pp.95-113
• /
• 2018

A mathematical knot is an embedded circle in ${\mathbb{R}}^3$. A fundamental problem in knot theory is classifying knots up to its numbers of crossing points. Knots are often distinguished by using a knot invariant, a quantity which is the same for equivalent knots. Knot polynomials are one of well known knot invariants. In 2006, J. Przytycki showed the effects of a n - move (a local change in a knot diagram) on several knot polynomials. In this paper, the authors review about knot polynomials, especially Jones polynomial, and give an alternative proof to a part of the Przytychi's result for the case n = 3 on the Jones polynomial.

• Korean Journal of Computational Design and Engineering
• /
• v.3 no.2
• /
• pp.103-112
• /
• 1998

In this paper insertion of numerous control points to be performed by using the Chebyshev polynomial root at the selection of knot vector. This method introduces a simple method of knot refinement and it is applied in a developed program. The Chebyshev roots exist densely in broth ends of the range and are proposed more effective knot refinement to modify a surface. Therefore, generated control points are relatively uniform in specified knot interval. In the surface generation, a local insertion of numerous control points are easily inserted by using the characteristic of Chebyshev polynomial roots at knot refinement. It is possible to create a complex surface with a single surface. The number of control point can be reduced by using the local insertion of control points in a required shape

• Bulletin of the Korean Mathematical Society
• /
• v.51 no.2
• /
• pp.539-545
• /
• 2014

We show that roots of log-concave Alexander knot polynomials are dense in C. This in particular implies that the log-concavity and Hoste's conjecture on the Alexander polynomial of alternating knots are (essentially) independent.

• East Asian mathematical journal
• /
• v.35 no.1
• /
• pp.31-40
• /
• 2019

We introduce a family of polynomial invariants by using intersection index defined from a Gauss diagram of a long virtual knot, and we give some properties for long virtual knots. We extend these polynomials so that we give two-variable polynomial invariants and some example.

• Korean Journal of Computational Design and Engineering
• /
• v.5 no.3
• /
• pp.276-284
• /
• 2000

Usual practice of the transformation of a B-spline curve into a set of piecewise polynomial curves in a power form is done by either a knot refinement followed by basis conversions or applying a Taylor expansion on the B-spline curve for each knot span. Presented in this paper is a new algorithm, called a direct expansion algorithm, for the problem. The algorithm first locates the coefficients of all the linear terms that make up the basis functions in a knot span, and then the algorithm directly obtains the power form representation of basis functions by expanding the summation of products of appropriate linear terms. Then, a polynomial segment of a knot span can be easily obtained by the summation of products of the basis functions within the knot span with corresponding control points. Repeating this operation for each knot span, all of the polynomials of the B-spline curve can be transformed into a power form. The algorithm has been applied to both static and dynamic curves. It turns out that the proposed algorithm outperforms the existing algorithms for the conversion for both types of curves. Especially, the proposed algorithm shows significantly fast performance for the dynamic curves.

• Kyungpook Mathematical Journal
• /
• v.54 no.2
• /
• pp.271-292
• /
• 2014

We introduce a new method to transform a knot diagram into a diagram of an unknot using a polynomial representation of the knot. Here the unknotting sequence of a knot diagram with least number of crossing changes can be realized by a family of polynomial maps. The number of singular knots in this family is defined to be the singularity index of the diagram. We show that the singularity index of a diagram is always less than or equal to its unknotting number.