𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the minimum ropelength of knots and links

✍ Scribed by Jason Cantarella; Robert B. Kusner; John M. Sullivan


Publisher
Springer-Verlag
Year
2002
Tongue
English
Weight
336 KB
Volume
150
Category
Article
ISSN
0020-9910

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Knots and links of nonabelian string
✍ Lee Brekke; Hans Dykstra; Shane J. Hughes; Tom D. Imbo πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 497 KB
The Jones polynomial of pretzel knots an
✍ Ryan A. Landvoy πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 708 KB

A formula for the Jones polynomial of pretzel knots and links is constructed using Kauffman's state model of the Jones polynomial. A computer program in Maple, which is given for calculations of these polynomials is also used to show that an infinite class of pretzel knots with trivial Alexander pol

Dehn surgery on arborescent knots and li
✍ Ying-Qing Wu πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 799 KB

In this survey, we present some recent results about Dehn surgeries on arborescent knots and links. Arborescent links are also known as algebraic links [l, 21 and star links [3]. The set of arborescent knots and links is a large class, including all 2-bridge links and Montesinos links. They have bee

Oriented Quantum Algebras and Invariants
✍ Louis H Kauffman; David E Radford πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 300 KB

In our previous work oriented quantum algebras were motivated and introduced in a very natural categorical setting within the context of knots and links, some examples were discussed, and a rudimentary theory of oriented quantum algebras was sketched. Invariants of knots and links can be computed fr

Realization of knots and links in a spat
✍ Kouki Taniyama; Akira Yasuhara πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 373 KB

For a graph G, let Ξ“ be either the set Ξ“ 1 of cycles of G or the set Ξ“ 2 of pairs of disjoint cycles of G. Suppose that for each Ξ³ ∈ Ξ“ , an embedding In this paper, we have the following three results: (1) For the complete graph K 5 on 5 vertices and the complete bipartite graph K 3,3 on 3 + 3 ver