There is a positive constant $c_1$ such that for any diagram $D$ representing the unknot, there is a sequence of at most $2^{c_1 n}$ Reidemeister moves that will convert it to a trivial knot diagram, $n$ is the number of crossings in $D$. A similar result holds for elementary moves on a polygonal knot $K$ embedded in the 1-skeleton of the interior of a compact, orientable, triangulated $PL$ 3-manifold $M$. There is a positive constant $c_2$ such that for each $t \geq 1$, if $M$ consists of $t$ tetrahedra, and $K$ is unknotted, then there is a sequence of at most $2^{c_2 t}$ elementary moves in $M$ which transforms $K$ to a triangle contained inside one tetrahedron of $M$. We obt...
We provide an upper bound on the number of ordered Reidemeister moves required to pass betw...
International audienceWe present three “hard” diagrams of the unknot. They require (at least) three ...
International audienceWe present three “hard” diagrams of the unknot. They require (at least) three ...
There is a positive constant $c_1$ such that for any diagram $D$ representing the unknot, t...
There is a positive constant c1 such that for any diagram D representing the unknot, there is a sequ...
Given any knot diagram E, we present a sequence of knot diagrams of the same knot type for which the...
We present a sequence of diagrams of the unknot for which the minimum number of Reidemeiste...
We present a sequence of diagrams of the unknot for which the minimum number of Reidemeiste...
AbstractUsing unknotting number, we introduce a link diagram invariant of type given in Hass and Now...
In mathematics, a knot is a single strand crossed over itself any number of times, and connected at ...
International audienceLet D be a knot diagram, and let D denote the set of diagrams that can be obta...
We construct a new order 1 invariant for knot diagrams. We use it to determine the minimal ...
We construct a new order 1 invariant for knot diagrams. We use it to determine the minimal ...
We present three “hard” diagrams of the unknot. They require (at least) three extra crossings before...
We provide an upper bound on the number of ordered Reidemeister moves required to pass betw...
We provide an upper bound on the number of ordered Reidemeister moves required to pass betw...
International audienceWe present three “hard” diagrams of the unknot. They require (at least) three ...
International audienceWe present three “hard” diagrams of the unknot. They require (at least) three ...
There is a positive constant $c_1$ such that for any diagram $D$ representing the unknot, t...
There is a positive constant c1 such that for any diagram D representing the unknot, there is a sequ...
Given any knot diagram E, we present a sequence of knot diagrams of the same knot type for which the...
We present a sequence of diagrams of the unknot for which the minimum number of Reidemeiste...
We present a sequence of diagrams of the unknot for which the minimum number of Reidemeiste...
AbstractUsing unknotting number, we introduce a link diagram invariant of type given in Hass and Now...
In mathematics, a knot is a single strand crossed over itself any number of times, and connected at ...
International audienceLet D be a knot diagram, and let D denote the set of diagrams that can be obta...
We construct a new order 1 invariant for knot diagrams. We use it to determine the minimal ...
We construct a new order 1 invariant for knot diagrams. We use it to determine the minimal ...
We present three “hard” diagrams of the unknot. They require (at least) three extra crossings before...
We provide an upper bound on the number of ordered Reidemeister moves required to pass betw...
We provide an upper bound on the number of ordered Reidemeister moves required to pass betw...
International audienceWe present three “hard” diagrams of the unknot. They require (at least) three ...
International audienceWe present three “hard” diagrams of the unknot. They require (at least) three ...