arXiv research

Computed minimum crossing numbers for Turaev genus 2 links.

Even knots with more than 30 crossings are not fertile.

In this paper we compute the sharp lower bounds for the crossing number of $n$-string $k$-loop essential tangles. For essential tangles with only string components, we characterise the ones with the minimum crossing number for a given number of components, both when the tangle has knotted strings or only unknotted stri…

A new knot invariant measures crossings in three orthogonal directions.

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 braids to study graph trees, amphicheirality, unknotting numbers, and periodic table…

A link diagram is said to be lune-free if, when viewed as a 4-regular plane graph it does not have multiple edges between any pair of nodes. We prove that any colored link diagram is equivalent to a colored lune-free diagram with the same number of colors. Thus any colored link diagram with a minimum number of colors (…

The study calculates the average genus of rational knots and links.

Shows large unknotting number for simple knots.

The unknotting number of a knot is the minimum number of crossings one must change to turn that knot into the unknot. The algebraic unknotting number is the minimum number of crossing changes needed to transform a knot into an Alexander polynomial-one knot. We work with a generalization of unknotting number due to Math…

In links with two components there are three different types of crossings: self-crossings in the first component, self crossings in the second component, and crossings between components. In this paper we examine the minimum number of crossing changes needed to unlink without changing the crossings between components. …

New bounds on ropelength for special alternating knots.

The paper studies how the crossing number of graphs changes with a specific transformation called ΔY-move.

The paper defines and calculates an upper bound for the equivariant crossing number of two-bridge knots.

For a knot or link K, let L(K) be the ropelength of K and Cr(K) be the crossing number of K. In this paper, we show that there exists a constant a>0 such that L(K) is bounded above by a Cr(K) ln^5 (Cr(K)) for any knot K. This result shows that the upper bound of the ropelength of any knot is almost linear in terms of i…

New methods for delta-moves on algebraically split links identified.

It is well known that the braid index of a link equals the minimum number of Seifert circles among all link diagrams representing it. For a link with a reduced alternating diagram $D$, $s(D)$, the number of Seifert circles in $D$, equals the braid index $\textbf{b}(D)$ of $D$ if $D$ contains no {\em lone crossings} (a …

A triple crossing is a crossing in a projection of a knot or link that has three strands of the knot passing straight through it. A triple crossing projection is a projection such that all of the crossings are triple crossings. We prove that every knot and link has a triple crossing projection and then investigate c_3(…

The splitting number of a link is the minimum number of crossing changes between distinct components that is required to convert the link into a split link. We provide a bound on the splitting number in terms of the four-genus of related knots.

The paper calculates ribbon numbers for 12-crossing knots using Alexander polynomials.

For a knot K, the concordance crosscap number, c(K), is the minimum crosscap number among all knots concordant to K. Building on work of G. Zhang, which studied the determinants of knots with c(K) < 2, we apply the Alexander polynomial to construct new algebraic obstructions to c(K) < 2. With the exception of low cross…

We present a sequence of diagrams of the unknot for which the minimum number of Reidemeister moves required to pass to the trivial diagram is quadratic with respect to the number of crossings. These bounds apply both in $S^2$ and in $\R^2$.

Given a virtual link diagram $D$, we define its unknotting index $U(D)$ to be minimum among $(m, n)$ tuples, where $m$ stands for the number of crossings virtualized and $n$ stands for the number of classical crossing changes, to obtain a trivial link diagram. By using span of a diagram and linking number of a diagram …

Investigates ropelength of complex knots and links.

We categorise coherent band (aka nullification) pathways between knots and 2-component links. Additionally, we characterise the minimal coherent band pathways (with intermediates) between any two knots or 2-component links with small crossing number. We demonstrate these band surgeries for knots and links with small cr…

This paper classifies a specific weave type by their crossing number.

Using region crossing changes, we define a new invariant called the multi-region index of a knot. We prove that the multi-region index of a knot is bounded from above by twice the crossing number of the knot. In addition, we show that the minimum number of generators of the first homology of the double branched cover o…

A knot is fertile if it can generate all smaller knots through a specific diagram modification.

The paper establishes a relation between knotoid crossing number and height.

The unknotting number of a knot is the minimum number of crossings one must change to turn that knot into the unknot. We work with a generalization of unknotting number due to Mathieu-Domergue, which we call the untwisting number. The p-untwisting number is the minimum number (over all diagrams of a knot) of full twist…

Study knots that divide ribbon knotted surfaces, computing their half ribbon genus and fusion number.

Study non-orientable 4-genus for 11-crossing non-alternating knots.

Proposes a method to solve deep neural networks' local minimum problem.

Paper calculates ball number of links using Lorentz geometry and circle packing.

Study minimum ribbonlength of immersed flat knots and links.

Knots are commonly found in molecular chains such as DNA and proteins, and they have been considered to be useful models for structural analysis of these molecules. One interested quantity is the minimum number of monomers necessary to realize a molecular knot. The minimum lattice length $\mbox{Len}(K)$ of a knot $K$ i…

It is well known that the minimum crossing number of an alternating link equals the number of crossings in any reduced alternating link diagram of the link. This remarkable result is an application of the Jones polynomial. In the case of the braid index of an alternating link, Murasugi had conjectured that the number o…

The stick number of a knot is the minimum number of segments needed to build a polygonal version of the knot. Despite its elementary definition and relevance to physical knots, the stick number is poorly understood: for most knots we only know bounds on the stick number. We adopt a Monte Carlo approach to finding bette…

A new method avoids overfitting in network reconstruction by using the minimum description length principle.

Study quantizes ropelength and writhe of 12-crossing knots.

This paper calculates stick numbers for rail arcs and knot classes.

New method to untangle knots using null-homologous twists.

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 knots, previous bounds on unknotting number obtained by Ozsvath and Szabo and b…

Delta-unlinking number measures how to unlink algebraically split links.

New upper bound on Jones polynomial for fibered positive links.

Let $\mbox{Len}(K)$ be the minimum length of a knot on the cubic lattice (namely the minimum length necessary to construct the knot in the cubic lattice). This paper provides upper bounds for $\mbox{Len}(K)$ of a nontrivial knot $K$ in terms of its crossing number $c(K)$ as follows: $\mbox{Len}(K) \leq \min \left\{ \fr…

Paper proves ribbonlength grows linearly with knot complexity.

Algorithm constructs and classifies weaving diagrams using combinatorial methods.

Given a knot K in S^3, let u^-(K) (respectively, u^+(K)) denote the minimum number of negative (respectively, positive) crossing changes among all unknotting sequences for K. We use knot Floer homology to construct the invariants l^-(K), l^+(K) and l(K), which give lower bounds on u^-(K), u^+(K) and the unknotting numb…