Related papers: A Sliceness Criterion for Odd Free Knots
The list of knots with up to 10 crossings is commonly referred to as the Rolfsen Table. This paper presents a way to generate the Rolfsen table in a simple, clear, and reproducible manner. The methods we use are similar to those used by J.…
Either fibered knots supporting the tight contact structure are unique in their smooth concordance class or there exists a fibered counterexample to the Slice-Ribbon Conjecture.
Sliding cable system with frictions is encountered in many engineering applications. Such system is typically characterized by existences of complex and varied motion states of different sliding nodes (pulleys), which leads to significant…
It is well-known that all 2-knots are slice. Are all 2-links slice? This is an outstanding open question. In this paper we prove the following: For any 2-component 2-link (J,K)in the 4-sphere which bounds the 5-ball B^5, there is an…
We introduce a new combinatorial method to encode knots and links with applications to knot invariants. Clasp diagrams defined in this paper are combinatorial blueprints for building knot diagrams out of full twists on two strings rather…
The (Strong) Slope Conjecture relates the degree of the colored Jones polynomial of a knot to certain essential surfaces in the knot complement. We verify the Slope Conjecture and the Strong Slope Conjecture for 3-string Montesinos knots…
A crucial step in the surgery-theoretic program to classify smooth manifolds is that of representing a middle--dimensional homology class by a smoothly embedded sphere. This step fails even for the simple 4-manifolds obtained from the…
In previous papers, the author realized the following principle for many knot theories: if a knot diagram is complicated enough then it reproduces itself, i.e., is a subdiagram of any other diagram equivalent to it. This principle is…
We explore free knot diagrams, which are projections of knots into the plane which don't record over/under data at crossings. We consider the combinatorial question of which free knot diagrams give which knots and with what probability.…
The untwisting number of a knot K is the minimum number of null-homologous twists required to convert K to the unknot. Such a twist can be viewed as a generalization of a crossing change, since a classical crossing change can be effected by…
The aim of this paper is to give a simple construction of the free skew-brace over a set $X$.
We prove that certain problems naturally arising in knot theory are NP--hard or NP--complete. These are the problems of obtaining one diagram from another one of a link in a bounded number of Reidemeister moves, determining whether a link…
One of the purposes in this paper is to provide a better understanding of the alternance property which occurs in Chebyshev polynomial approximation and piecewise polynomial approximation problems. In the first part of this paper, we…
Murasugi discovered two criteria that must be satisfied by the Alexander polynomial of a periodic knot. We generalize these to the case of twisted Alexander polynomials. Examples demonstrate the application of these new criteria, including…
We consider slice disks for knots in the boundary of a smooth compact 4-manifold $X^{4}$. We call a knot $K \subset \partial X$ deep slice in $X$ if there is a smooth properly embedded 2-disk in $X$ with boundary $K$, but $K$ is not…
This paper aims to give a one-to-one correspondence between $SU(2)$-representations of knot groups and colorings of knots with spherical quandles and give a geometric meaning of the "trace-free" condition we need to define Casson-Lin…
The concordance orders of many algebraic order two knots of ten or fewer crossings have been heretofore unknown. We use Casson-Gordon invariants and twisted Alexander polynomials to find that, in all but one case, these knots do not have…
It is a well-known procedure for constructing a torus knot or link that first we prepare an unknotted torus and meridian disks in the complementary solid tori of it, and second smooth the intersections of the boundary of meridian disks…
Perfect Matching-Cut is the problem of deciding whether a graph has a perfect matching that contains an edge-cut. We show that this problem is NP-complete for planar graphs with maximum degree four, for planar graphs with girth five, for…
A piecewise Chebyshevian spline space is a space of spline functions having pieces in different Extended Chebyshev spaces and where the continuity conditions between adjacent spline segments are expressed by means of connection matrices.…