Related papers: Minimal diagrams of classical and virtual links
The notion of free link is a generalized notion of virtual link. In the present paper we define the group of free braids, prove the Alexander theorem that all free links can be obtained as closures of free braids and prove a Markov theorem,…
This is an expository paper discussing various versions of Khovanov homology theories, interrelations between them, their properties, and their applications to other areas of knot theory and low-dimensional topology.
We exhibit the first examples of links which are homologically thin but not quasi-alternating. To show that they are not quasi-alternating, we argue that none of their branched double-covers bounds a negative definite 4-manifold with…
We show that the minimal number of colors for all effective $n$-colorings of a link with non-zero determinant is at least $1+\log_2 n$.
Halin showed that every edge minimal, k-vertex connected graph has a vertex of degree k. In this note, we prove the analogue to Halin's theorem for edge-minimal, k-edge-connected graphs. We show there are two vertices of degree k in every…
In this paper, we compute the slice genus for many low-crossing virtual knots. For instance, we show that 1295 out of 92800 virtual knots with 6 or fewer crossings are slice, and that all but 248 of the rest are not slice. Key to these…
In this paper we prove results relating to four homology theories developed in the topology of digital images: a simplicial homology theory by Arslan et al which is the homology of the clique complex, a singular simplicial homology theory…
Graph comparison is a certain type of condition on metric space encoded by a finite graph. We show that any nontrivial graph comparison implies one of Alexandrov's comparisons. The proof gives a complete description of graphs with trivial…
Every link in R^3 can be represented by a one-vertex ribbon graph. We prove a Markov type theorem on this subset of link diagrams.
This article proposes an algorithm that constructs a Sullivan minimal model for any simply connected simplicial set with effective homology and thereby allows one to decide algorithmically whether two simply connected spaces represented by…
We show that minimal models of log canonical pairs exist, assuming the existence of minimal models of smooth varieties.
We suggest a new random model for links based on meander diagrams and graphs. We then prove that trivial links appear with vanishing probability in this model, no link $L$ is obtained with probability 1, and there is a lower bound for the…
We provide combinatorial realizations, according to the usual objects/moves scheme, of the following three topological categories: (1) pairs (M,v) where M is a 3-manifold (up to diffeomorphism) and v is a (non-singular vector) field, up to…
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…
The Tait conjecture states that reduced alternating diagrams of links in S^3 have the minimal number of crossings. It has been proved in 1987 by M. Thistlethwaite, L.H. Kauffman and K. Murasugi studying the Jones polynomial. In this paper…
We show that every 4-uniform hypergraph with $n$ vertices and minimum pair degree at least $(5/9+o(1))n^2/2$ contains a tight Hamiltonian cycle. This degree condition is asymptotically optimal.
In this paper we give necessary conditions on group presentations, with two generators and one relator, in order to be the group of a virtual knot diagram. Although those conditions are not enough, we use them to determine, completely,…
In this short note we highlight some of the differences between cube diagrams and grid diagrams. We also list examples of small cube diagrams for all knots up to 7 crossings and give some examples of 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 paper we discuss algebraic, combinatorial and topological properties of singular virtual braids. On the algebraic side we state the relations between classical and virtual singular objects, in addition we discuss a Birman-like…