Related papers: Minimal diagrams of classical and virtual links
The present paper is a review of the current state of Graph-Link Theory (graph-links are also closely related to homotopy classes of looped interlacement graphs), dealing with a generalisation of knots obtained by translating the…
A virtual link diagram is called normal if the associated abstract link diagram is checkerboard colorable, and a virtual link is normal if it has a normal diagram as a representative.In this paper, we introduce a method of converting a…
We classify link diagrams with Turaev genus one and two in terms of an alternating tangle structure of the link diagram. The proof involves surgery along simple closed curves on the Turaev surface, called cutting loops, which have…
We introduce a version of Khovanov homology for alternating links with marking data, $\omega$, inspired by instanton theory. We show that the analogue of the spectral sequence from Khovanov homology to singular instanton homology introduced…
The homological scaffold leverages persistent homology to construct a topologically sound summary of a weighted network. However, its crucial dependency on the choice of representative cycles hinders the ability to trace back global…
Two welded (respectively virtual) link diagrams are homotopic if one may be transformed into the other by a sequence of extended Reidemeister moves, classical Reidemeister moves, and self crossing changes. In this paper, we extend Milnor's…
We construct a new spectral sequence beginning at the Khovanov homology of a link and converging to the Khovanov homology of the disjoint union of its components. The page at which the sequence collapses gives a lower bound on the splitting…
Quasi-alternating links are a generalization of alternating links. They are homologically thin for both Khovanov homology and knot Floer homology. Recent work of Greene and joint work of the first author with Kofman resulted in the…
For a given pair of numbers $(d,k)$, we establish the minimal number of vertices in pure $d$-dimensional simplicial complexes with non-trivial homology in dimension $k$. Furthermore, we solve the problem under the additional constraint of…
We define Khovanov homology mod 2 for graph-links.
A well-known conjecture states that for any $l$-component link $L$ in $S^3$, the rank of the knot Floer homology of $L$ (over any field) is less than or equal to $2^{l-1}$ times the rank of the reduced Khovanov homology of $L$. In this…
In the integral Khovanov homology of links, the presence of odd torsion is rare. Homologically thin links, that is links whose Khovanov homology is supported on two adjacent diagonals, are known to only contain $\mathbb{Z}_2$ torsion. In…
We present computational results about quasi-alternating knots and links and odd homology obtained by looking at link families in the Conway notation. More precisely, we list quasi-alternating links up to 12 crossings and the first examples…
We prove new lower bounds on the crossing number of a complete graphs assuming that it is drawn in such a way that it contains a Hamiltonian cycle with no crossings.
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…
We compute lower bounds on the virtual crossing number and minimal surface genus of virtual knot diagrams from the arrow polynomial. In particular, we focus on several interesting examples.
For classical links Ohyama proved an inequality involving the minimal crossing number and the braid index, then motivated from this Takeda showed an analogous inequality for virtual links. In this paper, we are interested in studying…
Several authors have recently studied virtual knots and links because they admit invariants arising from R-matrices. We prove that every virtual link is uniquely represented by a link L in S X I, a thickened, compact, oriented surface S,…
The splitting number of a link is the minimal number of crossing changes between different components required, on any diagram, to convert it to a split link. We introduce new techniques to compute the splitting number, involving covering…
Pseudodiagrams are knot or link diagrams where some of the crossing information is missing. Pseudoknots are equivalence classes of pseudodiagrams, where equivalence is generated by a natural set of Reidemeister moves. In this paper, we…