본문 바로가기
KERD
논문KCI 등재

Lower bounds for the number of positive and negative crossings in oriented link diagrams

2

조회

0

다운로드

0

인용

0

참고문헌

키워드

주제분류수학

초록

In this paper, we obtain a simple lower bound for the number of positive (resp. negative) crossings in oriented link diagrams in terms of the maximal (resp. minimal) degree of the Jones polynomial.

Abstract

In this paper, we obtain a simple lower bound for the number of positive (resp. negative) crossings in oriented link diagrams in terms of the maximal (resp. minimal) degree of the Jones polynomial.

참고문헌 (5)

  1. "KnotInfo: Table of Knot Invariants"[URL]
  2. V. F. R. Jones, "A polynomial invariant for knots via von Neumann algebras", Bull. Amer. Math. Soc, 12(1), pp.103~111 (1985)
  3. L. H. Kauffman, "State models and the Jones polynomial", Topology, 26(3), pp.395~407 (1987)
  4. K. Murasugi, "On invariants of graphs with applications to knot theory", Trans. Amer. Math. Soc, 314(1), pp.1~49 (1989)
  5. A. Stoimenow, "On some restrictions to the values of the Jones polynomial", Indiana Univ. Math. J, 54(2), pp.557~574 (2005)

관련 논문AI추천

이 간행물의 다른 논문 (24건)