Add to ORKGGiven any knot diagram E, we present a sequence of knot diagrams of the same knot type for which the minimum number of Reidemeister moves required to pass to E is quadratic with respect to the number of crossings. These bounds apply both in S 2 and in ℝ2
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 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...
There is a positive constant c1 such that for any diagram D representing the unknot, there is a sequ...
There is a positive constant $c_1$ such that for any diagram $D$ representing the unknot, t...
There is a positive constant $c_1$ such that for any diagram $D$ representing the unknot, t...
In mathematics, a knot is a single strand crossed over itself any number of times, and connected at ...
We present three “hard” diagrams of the unknot. They require (at least) three extra crossings before...
AbstractUsing unknotting number, we introduce a link diagram invariant of type given in Hass and Now...
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 ...
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 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 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...
There is a positive constant c1 such that for any diagram D representing the unknot, there is a sequ...
There is a positive constant $c_1$ such that for any diagram $D$ representing the unknot, t...
There is a positive constant $c_1$ such that for any diagram $D$ representing the unknot, t...
In mathematics, a knot is a single strand crossed over itself any number of times, and connected at ...
We present three “hard” diagrams of the unknot. They require (at least) three extra crossings before...
AbstractUsing unknotting number, we introduce a link diagram invariant of type given in Hass and Now...
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 ...
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 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 ...