Hostname: page-component-cd9895bd7-7cvxr Total loading time: 0 Render date: 2024-12-26T05:56:53.069Z Has data issue: false hasContentIssue false
  • English
  • Français

An upper bound of arc index of links

Published online by Cambridge University Press:  17 January 2001

YONGJU BAE  and
CHAN-YOUNG PARK
YONGJU BAE
Affiliation:
Department of Mathematics, College of Natural Sciences, Kyungpook National University, Taegu 702-701, Korea; e-mail: ybae@kyungpook.ac.kr, chnypark@kyungpook.ac.kr
CHAN-YOUNG PARK
Affiliation:
Department of Mathematics, College of Natural Sciences, Kyungpook National University, Taegu 702-701, Korea; e-mail: ybae@kyungpook.ac.kr, chnypark@kyungpook.ac.kr
Get access Rights & Permissions [Opens in a new window]

Abstract

In 1996, Cromwell and Nutt [7] found an upper bound on the arc index which is related to the minimal crossing number and conjectured that the upper bound achieves the lowest possible index for alternating links.

CONJECTURE. Let L be any prime link. Then α(L) [les ] c(L)+2. Moreover this inequality is strict if and only if L is not alternating.

In this paper, we define a new diagram, called a wheel diagram, of a link and use it to prove this conjecture.

Type
Research Article
Information
Mathematical Proceedings of the Cambridge Philosophical Society , Volume 129 , Issue 3 , November 2000 , pp. 491 - 500
Copyright
© 2000 Cambridge Philosophical Society

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)