Related papers: A 1-parameter approach to links in a solid torus

To a closed braid in a solid torus we associate a trace graph in a thickened torus in such a way that closed braids are isotopic if and only if their trace graphs can be related by trihedral and tetraherdal moves. For closed braids with a…

We introduce the concept of tied links in the solid torus, which generalize naturally the concept of tied links in $S^3$ previously introduced by Aicardi and Juyumaya. We also define an invariant of these tied links by using skein…

Let $\phi : S^1\times D^2\to S^1$ be the natural projection. An oriented knot $K\hookrightarrow V = S^1\times D^2$ is called an almost closed braid if the restriction of $\phi$ to K has exactly two (non-degenerate) critical points (and K is…

The closure of a braid in a closed orientable surface $\Sigma$ is a link in $\Sigma\times S^1$. We classify such closed surface braids up to isotopy and homeomorphism (with a small indeterminacy for isotopy of closed sphere braids),…

Tied links and the tied braid monoid were introduced recently by the authors and used to define new invariants for classical links. Here, we give a version purely algebraic-combinatoric of tied links. With this new version we prove that the…

We introduce new polynomial isotopy invariants for closed braids. They are constructed as polynomial valued {\em Gauss diagram 1-cocycles} evaluated on the full rotation of the closed braid $\hat \beta$ around the core of the corresponding…

The prime motivation behind this paper is to prove that any torus link can be realized as the union of the one-dimensional connected components of the set of critical values of the argument map restricted to a complex algebraic plane curve.…

Given a graph, does there exist an orientation of the edges such that the resulting directed graph is strongly connected? Robbins' theorem [Robbins, Am. Math. Monthly, 1939] states that such an orientation exists if and only if the graph is…

We present a simple combinatorial model for quasipositive surfaces and positive braids, based on embedded bipartite graphs. As a first application, we extend the well-known duality on standard diagrams of torus links to twisted torus links.…

It is shown that two braids represent transversally isotopic links if and only if one can pass from one braid to another by conjugations in braid groups, positive Markov moves, and their inverses.

If a graph $G$ can be embedded on the torus, and be embedded linklessly in $\mathbb{R}^3$, it's not known whether or not we can always find a linkless embedding of $G$ contained in the standard (unknotted) torus; We show that, for orders 9…

A Coxeter link is a closure of a product of two braids, one being a quasi-Coxeter element and the other being a product of partial full twists. This class of links includes torus knots \(T_{n,k}\) and torus links \(T_{n,nk}\). We identify…

We prove some necessary conditions for a link to be either concordant to a quasi-positive link, quasi-positive, positive, or the closure of a positive braid. The main applications of our results are a characterisation of positive links with…

We introduce a framework to analyze knots and links in an unmarked solid torus. We discuss invariants that detect when such links are equivalent under an ambient homeomorphism, and show that the multivariable Alexander polynomial is such in…

There is a well-known way to describe a link diagram as a (signed) plane graph, called its Tait graph. This concept was recently extended, providing a way to associate a set of embedded graphs (or ribbon graphs) to a link diagram. While…

A twisted torus link $T(p,q,r,s)$ is obtained by performing $s$ full twists on $r$ adjacent strands of the $(p,q)$-torus link. In this paper, we classify twisted torus links that are unlinks. We give a complete characterization of all…

We introduce the notion of rational links in the solid torus. We show that rational links in the solid torus are fully characterized by rational tangles, and hence by the continued fraction of the rational tangle. Furthermore, we generalize…

In classical knot theory, Markov's theorem gives a way of describing all braids with isotopic closures as links in $\mathbb{R}^3$. We present a version of Markov's theorem for extended loop braids with closure in $B^3 \times S^1$, as a…

The Alexander theorem (1923) and the Markov theorem (1936) are two classical results in knot theory that show respectively that every link is the closure of a braid and that braids that have the same closure are related by a finite number…

Frequently, knots are enumerated by their crossing number. However, the number of knots with crossing number $c$ grows exponentially with $c$, and to date computer-assisted proofs can only classify diagrams up to around twenty crossings.…