Related papers: A Sliceness Criterion for Odd Free Knots
In [D.A. Fedoseev, V.O. Manturov, A sliceness criterion for odd free knots,arXiv:1707.04923], the authors proved a sliceness criterion for odd free knots: free knots with odd chords. In the present paper we give a similar criterion for…
Here we discuss $r-$shake slice knots, and their relation to corks, we then prove that $0$-shake slice knots are slice.
These notes are based on the lectures given by the author during Winter Braids IX in Reims in March 2019. We discuss slice knots and why they are interesting, as well as some ways to decide if a given knot is or is not slice. We describe…
A proof that $0-$shake slice knots are slice.
An open question asks if every knot of 4-genus g_s can be changed into a slice knot by g_s crossing changes. A counterexample is given.
Given a simply-connected 4-manifold with boundary the 3-sphere, this paper establishes sufficient conditions for a knot in the boundary to be sliced by a locally flat disc in the 4-manifold, whose complement has finite cyclic fundamental…
In the present paper, we construct a simple invariant which provides a sliceness obstruction for {\em free knots}. This obstruction provides a new point of view to the problem of studying cobordisms of curves immersed in 2-surfaces, a…
A knot in $S^3$ is rationally slice if it bounds a disk in a rational homology ball. We give an infinite family of rationally slice knots that are linearly independent in the knot concordance group. In particular, our examples are all…
There is an infinitely generated free subgroup of the smooth knot concordance group with the property that no nontrivial element in this subgroup can be represented by an alternating knot. This subgroup has the further property that every…
We describe an algorithm to find ribbon disks for alternating knots, and the results of a computer implementation of this algorithm. The algorithm is underlain by a slice link obstruction coming from Donaldson's diagonalisation theorem. It…
We study the $\mathbb{CP}^2$-slicing number of knots, i.e. the smallest $m\geq 0$ such that a knot $K\subseteq S^3$ bounds a properly embedded, null-homologous disk in a punctured connected sum $(\#^m\mathbb{CP}^2)^{\times}$. We give a…
A pretzel knot $K$ is called $odd$ if all its twist parameters are odd, and $mutant$ $ribbon$ if it is mutant to a simple ribbon knot. We prove that the family of odd, 5-stranded pretzel knots satisfies a weaker version of the Slice-Ribbon…
Here, we prove that $0-$shake slice knots are slice.
A {\it stuck knot} is a knot diagram containing designated crossings, called {\it stuck crossings}, whose incident strands are required to remain locally non-separable. These rigidity constraints restrict the allowable ambient isotopies and…
We give a new construction of slice knots via annulus twists. The simplest slice knots obtained by our method are those constructed by Omae. In this paper, we introduce a sufficient condition for given slice knots to be ribbon, and prove…
We use the famous knot-theoretic consequence of Freedman's disc theorem---knots with trivial Alexander polynomial bound a locally-flat disc in the 4-ball---to prove the following generalization. The degree of the Alexander polynomial of a…
A knot in the three-sphere is doubly slice if it is the cross-section of an unknotted two-sphere in the four-sphere. For low-crossing knots, the most complete work to date gives a classification of doubly slice knots through 9 crossings. We…
A (weak chord) index is a function on the crossings of knot diagrams such that: 1) the index of a crossing does not change under Reidemeister moves; 2) crossings which can be paired by a second Reidemeister move have the same index. We show…
The first and last named authors have demonstrated the existence of knots for which every integral slope is non-characterizing. In this short note, we extend this result in two ways. There exists a knot that shares for every integer n the…
The goal of this paper is to discuss the possibility of finding an algorithm that can give all distinct knots up to a desired complexity. Two such algorithms are presented, one based on projections on a plane, the other on closed…