Related papers: An algorithm to find ribbon disks for alternating …
New presentations of a link and a virtual link are introduced and algebraic systems on links and virtual links are constructed respectively. Based on the algebraic systems, Reduction Crossing Algorithms for them are proposed which are used…
For a knot $K$, the doubly slice genus $g_{ds}(K)$ is the minimal $g$ such that $K$ divides a closed, orientable, and unknotted surface of genus $g$ embedded in $S^4$. In this paper, we identify the doubly slice genera of 2909 of the 2977…
We show that, for an alternating knot, the ratio of the diameter of the set of boundary slopes to the crossing number can be arbitrarily large.
Decomposing knots and links into tangles is a useful technique for understanding their properties. The notion of prime tangles was introduced by Kirby and Lickorish in [3]; Lickorish proved [5] that by summing prime tangles one obtains a…
There are infinitely many pretzel links with the same Alexander polynomial (actually with trivial Alexander polynomial). By contrast, in this note we revisit the Jones polynomial of pretzel links and prove that, given a natural number S,…
Given a knot complement X and its p-fold cyclic cover X_p, we identify twisted polynomials associated to 1-dimensional linear representations of the fundamental group of X_p with twisted polynomials associated to related p-dimensional…
We use a version of simulated annealing with knot-type preserving moves to find polygonal representatives of various knot types with low stick number. These give better bounds on stick numbers of prime knots through 10 crossings, and for…
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 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…
The ropelength of a knot is the minimum length required to tie it. Computational upper bounds have previously been computed for every prime knot with up to 11 crossings. Here, we present ropelength measurements for the 2176 knots with 12…
We find that Alexander polynomial of a ribbon knot in $ \mathbb{Z}HS^3 $ is determined by the intrinsic singularity information of its ribbon, and give a formula to calculate Alexander polynomial of a ribbon knot by that. We define half…
Let $K$ be a prime knot in $S^3$ and $G(K)=\pi_1(S^3-K)$ the knot group. We write $K_1 \geq K_2$ if there exists a surjective homomorphism from $G(K_1)$ onto $G(K_2)$. In this paper, we determine this partial order on the set of prime knots…
Ribbon concordances between knots generalize the notion of ribbon knots. Agol, building on work of Gordon, proved ribbon concordance gives a partial order on knots in $S^3$. In previous work, the author and Greene conjectured that positive…
This thesis develops some general calculational techniques for finding the orders of knots in the topological concordance group C. The techniques currently available in the literature are either too theoretical, applying to only a small…
We establish homotopy ribbon concordance obstructions coming from the Blanchfield form and Levine-Tristram signatures. Then, as an application of twisted Alexander polynomials, we show that for every knot K with nontrivial Alexander…
Generalizing unknotting number, $n$-adjacent knots have $n$ crossings such that changing any non-empty subset of them results in the unknot. In this paper, we determine the 2-adjacent knots through 12 crossings. Using Heegaard Floer…
We apply Donaldson's theorem on the intersection forms of definite 4--manifolds to characterize the lens spaces which smoothly bound rational homology 4--dimensional balls. Our result implies, in particular, that every smoothly slice…
We consider a natural model of random knotting- choose a knot diagram at random from the finite set of diagrams with n crossings. We tabulate diagrams with 10 and fewer crossings and classify the diagrams by knot type, allowing us to…
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 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…