We study methods for computing the bridge number of a knot from a knot diagram. We prove equivalence between a geometric and a combinatorial definition of the bridge number of a knot diagram. For each notion of diagrammatic bridge number considered, we find crossing number minimizing knot diagrams which fail to minimize bridge number. Furthermore, we construct a family of minimal crossing diagrams for which the difference between diagrammatic bridge number and the actual bridge number of the knot grows to infinity
AbstractWe present a practical algorithm to determine the minimal genus of non-orientable spanning s...
We present a practical algorithm to determine the minimal genus of non-orientable spanning surfaces ...
International audienceLet D be a knot diagram, and let D denote the set of diagrams that can be obta...
We study methods for computing the bridge number of a knot from a knot diagram. We prove equivalence...
Take a long string, tie it in a complicated knot, and fuse the ends together. This gives you a mathe...
We define the Wirtinger number of a link, an invariant closely related to the meridional rank. The W...
The “bridge index” of a knot is the least number of maximal overpasses taken over all diagrams of th...
An n-crossing is a point in the projection of a knot where n strands cross so that each strand bisec...
In this paper we present a branch-and-bound algorithm for finding the minimum crossing number of a g...
This research paper was completed and submitted at Nipissing University, and is made freely accessib...
A “butterfly diagram” is a representation of a knot as a kind of graph on the sphere. This generaliz...
For any given number of crossings c, there exists a formula to determine the number of 2-bridge knot...
The aim of the present paper is to prove that the minimal number of virtual crossings for some famil...
A method is given for economically constructing any algebraic knot or link K. This construction, whi...
In diploma thesis we will describe concept of a knot invariant known as the stick number. This conce...
AbstractWe present a practical algorithm to determine the minimal genus of non-orientable spanning s...
We present a practical algorithm to determine the minimal genus of non-orientable spanning surfaces ...
International audienceLet D be a knot diagram, and let D denote the set of diagrams that can be obta...
We study methods for computing the bridge number of a knot from a knot diagram. We prove equivalence...
Take a long string, tie it in a complicated knot, and fuse the ends together. This gives you a mathe...
We define the Wirtinger number of a link, an invariant closely related to the meridional rank. The W...
The “bridge index” of a knot is the least number of maximal overpasses taken over all diagrams of th...
An n-crossing is a point in the projection of a knot where n strands cross so that each strand bisec...
In this paper we present a branch-and-bound algorithm for finding the minimum crossing number of a g...
This research paper was completed and submitted at Nipissing University, and is made freely accessib...
A “butterfly diagram” is a representation of a knot as a kind of graph on the sphere. This generaliz...
For any given number of crossings c, there exists a formula to determine the number of 2-bridge knot...
The aim of the present paper is to prove that the minimal number of virtual crossings for some famil...
A method is given for economically constructing any algebraic knot or link K. This construction, whi...
In diploma thesis we will describe concept of a knot invariant known as the stick number. This conce...
AbstractWe present a practical algorithm to determine the minimal genus of non-orientable spanning s...
We present a practical algorithm to determine the minimal genus of non-orientable spanning surfaces ...
International audienceLet D be a knot diagram, and let D denote the set of diagrams that can be obta...