相关论文: Integer Knot Invariants: Inequalities, Computation…

This an article about some elementary geometric and combinatorial natures of various knot energies. A related "new" knot invariant -- the X-crossing number -- is introduced.

We consider intrinsic linking and knotting in the context of directed graphs. We construct an example of a directed graph that contains a consistently oriented knotted cycle in every embedding. We also construct examples of intrinsically…

This paper studies rotational virtual knot theory and its relationship with quantum link invariants. Every quantum link invariant for classical knots and links extends to an invariant of rotational virtual knots and links. The paper sets up…

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…

The homology and cohomology of quandles and racks are used in knot theory: given a finite quandle and a cocycle, we can construct a knot invariant. This is a quick introductory survey to the invariants of knots derived from quandles and…

We explore a knot invariant derived from colorings of corresponding $1$-tangles with arbitrary connected quandles. When the quandle is an abelian extension of a certain type the invariant is equivalent to the quandle $2$-cocycle invariant.…

We study symmetric crossing change operations for strongly invertible knots. Our main theorem is that the most natural notion of equivariant unknotting number is not additive under connected sum, in contrast with the longstanding conjecture…

The slicing number of a knot, $u_s(K)$, is the minimum number of crossing changes required to convert $K$ to a slice knot. This invariant is bounded above by the unknotting number and below by the slice genus $g_s(K)$. We show that for many…

We introduce new sufficient conditions for intrinsic knotting and linking. A graph on n vertices with at least 4n-9 edges is intrinsically linked. A graph on n vertices with at least 5n-14 edges is intrinsically knotted. We also classify…

We establish a novel connection between algebraic number theory and knot theory. We show that the number of equivalence classes of integral binary quadratic forms of discriminant $t^2 - 4$ (for $t\neq \pm 2$) is equal to the number of…

We use the knot filtration on the Heegaard Floer complex to define an integer invariant tau(K) for knots. Like the classical signature, this invariant gives a homomorphism from the knot concordance group to Z. As such, it gives lower bounds…

In this paper a classification of Reidemeister moves, which is the most refined, is introduced. In particular, this classification distinguishes some $\Omega_3$-moves that only differ in how the three strands that are involved in the move…

We proved by computer enumeration that the Jones polynomial distinguishes the unknot for knots up to 22 crossings. Following an approach of Yamada, we generated knot diagrams by inserting algebraic tangles into Conway polyhedra, computed…

This manuscript introduces a new framework for the study of knots by exploring the neighborhood of knot embeddings in the space of simple open and closed curves in 3-space. The latter gives rise to a knotoid spectrum, which determines the…

We define counting and cocycle enhancement invariants of virtual knots using parity biquandles. These invariants are determined by pairs consisting of a biquandle 2-cocycle \phi^0 and a map \phi^1 with certain compatibility conditions…

The notion of a pseudoknot is defined as an equivalence class of knot diagrams that may be missing some crossing information. We provide here a topological invariant schema for pseudoknots and their relatives, 4-valent rigid vertex spatial…

We prove a formula for the involutive concordance invariants of the cabled knots in terms of that of the companion knot and the pattern knot. As a consequence, we show that any iterated cable of a knot with parameters of the form (odd,1) is…

We introduce and study so-called self-indexed graphs. These are (oriented) finite graphs endowed with a map from the set of edges to the set of vertices. Such graphs naturally arise from classical knot and link diagrams. In fact, the graphs…

In [14], the second named author constructed the bracket invariant [.] of virtual knots valued in pictures (linear combinations of virtual knot diagrams with some crossing information omitted), such that for many diagrams K, the following…

Symmetries of knots have been studied extensively, and strongly invertible knots are one of them. Lamm defined the equivariant crossing number $c_t(K)$, the minimum crossing number among all symmetric diagrams for a strongly invertible knot…