Related papers: t_k-moves on links
We give a new, elementary proof of what we believe is the simplest known example of a ``natural'' problem in computational 3-dimensional topology that is $\mathsf{NP}$-hard -- namely, the \emph{Trivial Sublink Problem}: given a diagram $L$…
In this study of the Reidemeister moves within the classical knot theory, we focus on hard diagrams of knots and links, categorizing them as either rigid or shaky based on their adaptability to certain moves. We establish that every link…
We prove that the Khovanov homology of alternating knots and 2-component links is equal (as a singly graded group) to the singular homology of a certain space of trace- free, binary dihedral representations of the link group. More…
In this paper, we study a geometric/topological measure of knots and links called the nullification number. The nullification of knots/links is believed to be biologically relevant. For example, in DNA topology, one can intuitively regard…
This paper has two-fold goal: it provides gentle introduction to Knot Theory starting from 3-coloring, the concept introduced by R. Fox to allow undergraduate students to see that the trefoil knot is non-trivial, and ending with statistical…
A {\em blink} is a plane graph with an arbitrary bipartition of its edges. As a consequence of a recent result of Martelli, I show that the homeomorphisms classes of closed oriented 3-manifolds are in 1-1 correspondence with specific…
A handlebody-link is a disjoint union of embeddings of handlebodies in $S^3$ and an HL-homotopy is an equivalence relation on handlebody-links generated by self-crossing changes. The second author and Ryo Nikkuni classified the set of…
Khovanov homology ist a new link invariant, discovered by M. Khovanov, and used by J. Rasmussen to give a combinatorial proof of the Milnor conjecture. In this thesis, we give examples of mutant links with different Khovanov homology. We…
As a generalization of the linking number, we construct a set of invariant numbers for two-component handlebody-links. These numbers are elementary divisors associated with the natural homomorphism from the first homology group of a…
In a previous paper, the authors proved that Milnor link-homotopy invariants modulo $n$ classify classical string links up to $2n$-move and link-homotopy. As analogues to the welded case, in terms of Milnor invariants, we give here two…
In this report, I will start by first giving a brief introduction on knots to build some intuition before beginning the more rigorous review in the Literature Review section. There, I will define knot equivalence, the Jones polynomial…
In links with two components there are three different types of crossings: self-crossings in the first component, self crossings in the second component, and crossings between components. In this paper we examine the minimum number of…
Many real-world complex networks are best modeled as bipartite (or 2-mode) graphs, where nodes are divided into two sets with links connecting one side to the other. However, there is currently a lack of methods to analyze properly such…
In this paper, we prove that given two cubical links of dimension two in ${\mathbb R}^4$, they are isotopic if and only if one can pass from one to the other by a finite sequence of cubulated moves. These moves are analogous to the…
By adding or removing appropriate structures to Gauss diagram, one can create useful objects related to virtual links. In this paper few objects of this kind are studied: twisted virtual links generalizing virtual links; signed chord…
The construction of link polynomials associated with finite dimensional representations of ribbon quasi-Hopf algebras is discussed in terms of the formulation of an appropriate Markov trace. We then show that this Markov trace is invariant…
In this thesis we work with Khovanov homology of links and its generalizations, as well as with the homology of graphs. Khovanov homology of links consists of graded chain complexes which are link invariants, up to chain homotopy, with…
Oikawa defined an unknotting operation on virtual knots, called a CF-move, and gave a classification of 2-component virtual links up to CF-moves by the virtual linking number and his $n$-invariant. In particular, it was proved that a…
The maximum length of the shortest path from a leaf to the root of a skein tree for knots and links gives a measure of the complexity of computing link polynomials by the skein relation (the Jones polynomial, the Alexander-Conway…
In this paper we present a sequence of link invariants, defined from twisted Alexander polynomials, and discuss their effectiveness in distinguish knots. In particular, we recast and extend by geometric means a recent result of Silver and…