Related papers: Minimal Flat Knotted Ribbons

In this article we take up the calculation of the minimum number of colors needed to produce a non-trivial coloring of a knot. This is a knot invariant and we use the torus knots of type (2, n) as our case study. We calculate the minima in…

We show that a group presented by a labelled oriented tree presentation in which the tree has diameter at most three is an HNN extension of a finitely presented group. From results of Silver, it then follows that the corresponding higher…

For a ribbon knot, it is a folk conjecture that the rank of its knot Floer homology must be 1 modulo 8, and another folk conjecture says the same about reduced Khovanov homology. We give the first counter-examples to both of these folk…

We give a Dehn surgery characterization of the trefoil and the figure eight knots. These results are gotten by combining surgery formulas in Heegaard Floer homology from an earlier paper with the characterization of these knots in terms of…

Flat plumbing basket surfaces of links were introduced to study the geometry of the complement of the links. These flat plumbing basket surface can be presented by a sequential presentation known as flat plumbing basket code first found by…

It is an open problem, posed in \cite{SoCG}, to determine the minimal $k$ such that an open flexible $k$-chain can interlock with a flexible 2-chain. It was first established in \cite{GLOSZ} that there is an open 16-chain in a trapezoid…

We use matchings on Lyndon words to classify flat knots up to 8 crossings. Using flat knots invariants such as the based matrix, the $\phi$-invariant, the flat arrow polynomial, and the flat Jones-Krushkal polynomial, we distinguish all…

Ribbon concordance gives a partial order on knot types, and applying a knot homology functor to a ribbon concordance gives an inclusion of the homologies. The question of the existence of global ribbon minima in each concordance class is a…

A physical interpretation of the rope simulated by the SONO algorithm is presented. Properties of the tight polygonal knots delivered by the algorithm are analyzed. An algorithm for bounding the ropelength of a smooth inscribed knot is…

Let $D$ be a knot diagram, and let ${\mathcal D}$ denote the set of diagrams that can be obtained from $D$ by crossing exchanges. If $D$ has $n$ crossings, then ${\mathcal D}$ consists of $2^n$ diagrams. A folklore argument shows that at…

We prove that a simple knot in the lens space $L(p,q)$ fibers if and only if its order in homology does not divide any remainder occurring in the Euclidean algorithm applied to the pair $(p,q)$. One corollary is that if $p=m^2$ is a perfect…

We determine the lengths of certain 3-cocycles of the 7-dihedral and the octahedral quandles. As a consequence, we show that both of the 2-twist-spun $5_{2}$-knot and the 4-twist-spun trefoil have the triple point number eight.

It is known that any open necklace with beads of $t$ types in which the number of beads of each type is divisible by $k$, can be partitioned by at most $(k-1)t$ cuts into intervals that can be distributed into $k$ collections, each…

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.…

Minimum braids are a complete invariant of knots and links. This paper defines minimum braids, describes how they can be generated, presents tables for knots up to ten crossings and oriented links up to nine crossings, and uses minimum…

We define a knot to be half ribbon if it is the cross-section of a ribbon 2-knot, and observe that ribbon implies half ribbon implies slice. We introduce the half ribbon genus of a knot K, the minimum genus of a ribbon knotted surface of…

We define the symmetric braid index $b_s(K)$ of a ribbon knot $K$ to be the smallest index of a braid whose closure yields a symmetric union diagram of $K$, and derive a Khovanov-homological characterisation of knots with $b_s(K)$ at most…

In a previous paper, we introduced special types of fusions, so called simple-ribbon fusions on links. A knot obtained from the trivial knot by a finite sequence of simple-ribbon fusions is called a simple-ribbon knot. Every ribbon knot…

In this paper, we give the trivializing number of all minimal diagrams of positive 2-bridge knots, and study the relation between the trivializing number and the unknotting number for a part of these knots.

We improve the lower bound for the minimum number of colors for linear Alexander quandle colorings of a knot given in Theorem 1.2 of Colorings beyond Fox: The other linear Alexander quandles (Linear Algebra and its Applications, Vol. 548,…