Related papers: Virtual links which are equivalent as twisted link…
We define a grid presentation for singular links i.e. links with a finite number of rigid transverse double points. Then we use it to generalize link Floer homology to singular links. Besides the consistency of its definition, we prove that…
This paper studies an algebraic invariant of virtual knots called the biquandle. The biquandle generalizes the fundamental group and the quandle of virtual knots. The approach taken in this paper to the biquandle emphasizes understanding…
We show that any virtual or welded period of a classical knot $K$ can be realized as a classical period. A direct consequence is that a classical knot admits only finitely many virtual or welded periods.
In a simple drawing of a graph, any two edges intersect in at most one point (either a common endpoint or a proper crossing). A simple drawing is generalized twisted if it fulfills certain rather specific constraints on how the edges are…
We define half grid diagrams and prove every link is half grid presentable by constructing a canonical half grid pair (which gives rise to a grid diagram of some special type) associated with an element in the oriented Thompson group. We…
Traditionally, alternating links are studied with alternating diagrams on $S^2$ in $S^3$. In this paper, we consider links which are alternating on higher genus surfaces $S_g$ in $S_g \times I$. We define what it means for such a link to be…
We define a family of virtual knots generalizing the classical twist knots. We develop a recursive formula for the Alexander polynomial $\Delta_0$ (as defined by Silver and Williams) of these virtual twist knots. These results are applied…
A gordian unlink is a finite number of unknots that are not topologically linked, each with prescribed length and thickness, and that cannot be disentangled into the trivial link by an isotopy preserving length and thickness throughout. In…
We construct an algorithm to decide whether two given Legendrian or transverse links are equivalent. In general, the complexity of the algorithm is too high for practical implementation. However, in many cases, when the symmetry group of…
Over the years, several Bridges papers have delved into the concept of danceability of a knot diagram. Inspired by dancing on non-orientable surfaces, in this paper, we expand danceability to twisted virtual knot diagrams. This paper is…
An alternating distance is a link invariant that measures how far away a link is from alternating. We study several alternating distances and demonstrate that there exist families of links for which the difference between certain…
A virtual knot, which is one of generalizations of knots in $\mathbb{R}^{3}$ (or $S^{3}$), is, roughly speaking, an embedded circle in thickened surface $S_{g} \times I$. In this paper we will discuss about knots in 3 dimensional $S_{g}…
Flat virtual links are some variant of links, and semiquandles are counterparts of quandles or biquandles, which axiomize the Reidemeister-like moves. In this paper, we give some example of semiquandle and introduce an invariant for flat…
The present paper is an introduction to a combinatorial theory arising as a natural generalisation of classical and virtual knot theory. There is a way to encode links by a class of `realisable' graphs. When passing to generic graphs with…
It is a natural question to ask whether two links are equivalent by the following moves -- parallel parts of a link are changed to k-times half-twisted parts and if they are, how many moves are needed to go from one link to the other. In…
We study concordance of virtual knots. Our main result is that a classical knot K is virtually slice if and only if it is classically slice. From this we deduce that the concordance group of classical knots embeds into the concordance group…
Piecewise-linear virtual knots are discussed and classified up to edge index six.
Two virtual link diagrams are homotopic if one may be transformed into the other by a sequence of virtual Reidemeister moves, classical Reidemeister moves, and self crossing changes. We recall the pure virtual braid group. We then describe…
To an oriented link in a solid torus we associate a trace graph in a thickened torus in such a way that links are isotopic if and only if their trace graphs can be related by moves of finitely many standard types. The key ingredient is a…
A thesaurus is one, out of many, possible representations of term (or word) connectivity. The terms of a thesaurus are seen as the nodes and their relationship as the links of a directed graph. The directionality of the links retains all…