An upper bound of arc index of links

By Yongju Bae, Chan-Young Park. Mathematical Proceedings of the Cambridge Philosophical Society, 2000

62 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Geometry and Topology

View Paper: https://www.semanticscholar.org/paper/66b065b05f4b6725a153704f032bf1396b006d31

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. John A. Baldwin

In Discrete Mathematics and Combinatorics

1. John A. Baldwin
2. W. D. Gillam

In Geometry and Topology

1. John A. Baldwin
2. W. D. Gillam
3. J. Greene
4. Peter S. Ozsv'ath
5. Zolt'an Szab'o

Citations in the corpus

• Computations of Heegaard-Floer knot homology (2006, background): “For example, �(10124) = 8 but Cromwell [2] showed that all alternating knots K with 10 or fewer crossings have �(K) = c(K) + 2 (this fact is proved for alternating knots with any number of crossings in [ 1 ], which is fortunate since \”
• AN INTRODUCTION TO KNOT FLOER HOMOLOGY (2014, unknown): “ngs in a planar projection). However, an alternate listing can be done in terms of the arc index, as in [JP10]. It is known that for alternating links, the arc index equals the crossing number plus 2 [BP00], while for non-alternating prime links, the arc index is smaller than or equal to the crossin”