Related papers: A characterization of almost alternating knot

We specify the computational complexity of crosscap numbers of alternating knots by introducing an automatic computation. For an alternating knot $K$, let $\cal{E}$ be the number of edges of its diagram. Then there exists a code such that…

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…

Let $K\subset S^3$ be a knot, $X:= S^3\setminus K$ its complement, and $\mathbb{T}$ the circle group identified with $\mathbb{R}/\mathbb{Z}$. To any oriented long knot diagram of $K$, we associate a quadratic polynomial in variables…

We study near-alternating links whose diagrams satisfy conditions generalized from the notion of semi-adequate links. We extend many of the results known for adequate knots relating their colored Jones polynomials to the topology of…

A `total Chern class' invariant of knots is defined. This is a universal Vassiliev invariant which is integral `on the level of Lie algebras' but it is not expressible as an integer sum of diagrams. The construction is motivated by…

For any knot with genus one and unknotting number one, other than the figure-eight knot, we prove that there is exactly one way to unknot it by means of a crossing change. In the case of the figure-eight knot, we prove that there are…

Hyperfinite knots, or limits of equivalence classes of knots induced by a knot invariant taking values in a metric space, were introduced in a previous article by the author. In this article, we present new examples of hyperfinite knots…

A knot is a closed loop in space without self-intersection. Two knots are equivalent if there is a self homeomorphism of space bringing one onto the other. An arc presentation is an embedding of a knot in the union of finitely many half…

Piecewise-linear virtual knots are discussed and classified up to edge index six.

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…

This article provides an overview of relative strengths of polynomial invariants of knots and links, such as the Alexander, Jones, Homflypt, and Kaufman two-variable polynomial, Khovanov homology, factorizability of the polynomials, and…

We review a constructions of knots from elements of the Thompson groups due to Vaughan Jones, which comes in two flavours: oriented and unoriented.

We introduce an alternative stratification of knots: by the size of lattice on which a knot can be first met. Using this classification, we find ratio of unknots and knots with more than 10 minimal crossings inside different lattices and…

We discuss relations among various positivities of knots and links, such as strong quasipositivity and quasipositivity. We give several pieces of supporting evidence for conjectural statements concerning these positivities and the defect of…

We define a variation of Khovanov homology with an explicit description in terms of the spanning trees of a link projection. We prove that this new theory is a link invariant and describe some of its properties. Finally, we provide some the…

We discuss the fundamental (relative) 3-classes of knots (or hyperbolic links), and provide diagrammatic descriptions of the push-forwards with respect to every link-group representation. The point is an observation of a bridge between the…

We classify 3-braid knots whose topological 4-genus coincides with their Seifert genus, using McCoy's twisting method and the Xu normal form. In addition, we give upper bounds for the topological 4-genus of positive and strongly…

Fractional Dehn twists give a measure of the difference between the relative isotopy class of a homeomorphism of a bordered surface and the Thurston representative of its free isotopy class. We show how to estimate and compute these…

A graph drawing in the plane is called an almost embedding if the images of any two non-adjacent simplices (i.e. vertices or edges) are disjoint. Almost embeddings (more precisely, their higher-dimensional analogues) naturally appear in…

We study the gordian graph of all knots in $\R^3$: two knots are adjacent if they differ by a single crossing change. We prove that this graph contains isometrically an infinite countable tree with infinite valency, and that the complement…