Related papers: Learning bridge numbers of knots

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…

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…

This paper is an introduction to the subject of virtual knot theory, combined with a discussion of some specific new theorems about virtual knots. The new results are as follows: We prove, using a 3-dimensional topology approach that if a…

The study of knot mosaics is based upon representing knot diagrams using a set of tiles on a square grid. This branch of knot theory has many unanswered questions, especially regarding the efficiency with which we draw knots as mosaics.…

The identification of nodes occupying important positions in a network structure is crucial for the understanding of the associated real-world system. Usually, betweenness centrality is used to evaluate a node capacity to connect different…

Two natural generalizations of knot theory are the study of spatial graphs and virtual knots. Our goal is to unify these two approaches into the study of virtual spatial graphs. This paper is a survey, and does not contain any new results.…

Non-classical virtual knots may have non-isomorphic upper and lower quandles. We exploit this property to define the quandle difference invariant, which can detect non-classicality by comparing the numbers of homomorphisms into a finite…

Virtual knot theory is a generalization (discovered by the author in 1996) of knot theory to the study of all oriented Gauss codes. (Classical knot theory is a study of planar Gauss codes.) Graph theory studies non-planar graphs via…

We introduce an unknotting-type number of knot projections that gives an upper bound of the crosscap number of knots. We determine the set of knot projections with the unknotting-type number at most two, and this result implies classical…

Virtual knots, defined by Kauffman, provide a natural generalization of classical knots. Most invariants of knots extend in a natural way to give invariants of virtual knots. In this paper we study the fundamental groups of virtual knots…

It has been conjectured that the algebraic crossing number of a link is uniquely determined in minimal braid representation. This conjecture is true for many classes of knots and links. The Morton-Franks-Williams inequality gives a lower…

We consider several classes of knotted objects, namely usual, virtual and welded pure braids and string links, and two equivalence relations on those objects, induced by either self-crossing changes or self-virtualizations. We provide a…

We study the equivariant concordance classes of two-bridge knots, providing an easy formula to compute their butterfly polynomial, and we give two different proofs that no two-bridge knot is equivariantly slice. Finally, we introduce a new…

We construct two complete invariants of oriented classical knots in space. The value of each invariant on any knot is a set, infinite for the first invariant and finite for the second. The finite set is computed algorithmically from any…

In this paper, we consider two properties on the braid index of a two-bridge knot. We prove an inequality on the braid indices of two-bridge knots if there exists an epimorphism between their knot groups. Moreover, we provide the average…

Knotted molecules occur naturally and are designed by scientists to gain special biological and material properties. Understanding and utilizing knotting require efficient methods to recognize and generate knotted structures, which are…

The motivation for this work is to construct a map from classical knots to virtual ones. What we get in the paper is a series of maps from knots in the full torus (thickened torus) to flat-virtual knots. We give definition of flat-virtual…

We discuss the possibility of the existence of finite algorithms that may give distinct knot classes. In particular we present two attempts for such algorithms which seem promising, one based on knot projections on a plane, the other on…

This paper concerns the H(2)-unknotting numbers of links related to 2-bridge links. It consists of three parts. In the first part, we consider a necessary and sufficient condition for a 2-bridge link to have H(2)-unknotting number one. The…

We will strengthen the known upper and lower bounds on the delta-crossing number of knots in therms of the triple-crossing number. The latter bound turns out to be strong enough to obtain (unknown values of) triple-crossing numbers for a…