Add to ORKGAbstract. Plumbing surfaces of links were introduced to study the geometry of the complement of the links. A basket surface is one of these plumbing surfaces and it can be presented by two sequen-tial presentations, the first sequence is the flat plumbing basket code found by Furihata, Hirasawa and Kobayashi and the second sequence presents the number of the full twists for each of annuli. The min-imum number of plumbings to obtain a basket surface of a knot is defined to be the basket number of the given knot. In present arti-cle, we first find a classification theorem about the basket number of knots. We use these sequential presentations and the classification theorem to find the basket number of all prime knots whose crossing number is ...
ABSTRACT. Introduced recently, an n-crossing is a singular point in a projection of a link at which ...
In diploma thesis we will describe concept of a knot invariant known as the stick number. This conce...
Take a long string, tie it in a complicated knot, and fuse the ends together. This gives you a mathe...
Abstract. Flat plumbing basket surfaces of links were introduced to study the geometry of the comple...
The structure of classical minimal prime knot presentations suggests that there are often, perhaps a...
The tabulation of all prime knots up to a given number of crossings was one of the founding problems...
For any given number of crossings c, there exists a formula to determine the number of 2-bridge knot...
The concepts of tile number and space-efficiency for knot mosaics were first explored by Heap and Kn...
An n-crossing is a point in the projection of a knot where n strands cross so that each strand bisec...
We use algorithms in the software KnotPlot to compute upper bounds for the equilateral stick numbers...
We study methods for computing the bridge number of a knot from a knot diagram. We prove equivalence...
The unknotting or triple point cancelling number of a surface link F is the least number of 1-handle...
AbstractThe unknotting or triple point cancelling number of a surface link F is the least number of ...
One of the most basic invariants of a knot K is its crossing number c(K), which is the minimal numbe...
Previous work used polygonal realizations of knots to reduce the problem of computing the superbridg...
ABSTRACT. Introduced recently, an n-crossing is a singular point in a projection of a link at which ...
In diploma thesis we will describe concept of a knot invariant known as the stick number. This conce...
Take a long string, tie it in a complicated knot, and fuse the ends together. This gives you a mathe...
Abstract. Flat plumbing basket surfaces of links were introduced to study the geometry of the comple...
The structure of classical minimal prime knot presentations suggests that there are often, perhaps a...
The tabulation of all prime knots up to a given number of crossings was one of the founding problems...
For any given number of crossings c, there exists a formula to determine the number of 2-bridge knot...
The concepts of tile number and space-efficiency for knot mosaics were first explored by Heap and Kn...
An n-crossing is a point in the projection of a knot where n strands cross so that each strand bisec...
We use algorithms in the software KnotPlot to compute upper bounds for the equilateral stick numbers...
We study methods for computing the bridge number of a knot from a knot diagram. We prove equivalence...
The unknotting or triple point cancelling number of a surface link F is the least number of 1-handle...
AbstractThe unknotting or triple point cancelling number of a surface link F is the least number of ...
One of the most basic invariants of a knot K is its crossing number c(K), which is the minimal numbe...
Previous work used polygonal realizations of knots to reduce the problem of computing the superbridg...
ABSTRACT. Introduced recently, an n-crossing is a singular point in a projection of a link at which ...
In diploma thesis we will describe concept of a knot invariant known as the stick number. This conce...
Take a long string, tie it in a complicated knot, and fuse the ends together. This gives you a mathe...