Related papers: The delta-unlinking number of algebraically split …

We prove that if an alternating 3-braid knot has unknotting number one, then there must exist an unknotting crossing in any alternating diagram of it, and we enumerate such knots. The argument combines the obstruction to unknotting number…

We give a sufficient condition for an almost alternating link diagram to represent a non-splittable link. The main theorem gives us a way to see if a given almost alternating link diagram represents a splittable link without increasing…

Knots and links have been considered to be useful models for structural analysis of molecular chains such as DNA and proteins. One quantity that we are interested on molecular links is the minimum number of monomers necessary to realize…

In this paper we discuss a pair of polynomial knot invariants $\Theta=(\Delta,\theta)$ which is: * Theoretically and practically fast: $\Theta$ can be computed in polynomial time. We can compute it in full on random knots with over 300…

We introduce a new link invariant called the algebraic genus, which gives an upper bound for the topological slice genus of links. In fact, the algebraic genus is an upper bound for another version of the slice genus proposed here: the…

Diaconis and Graham studied a measure of distance from the identity in the symmetric group called total displacement and showed that it is bounded below by the sum of length and reflection length. They asked for a characterization of the…

We introduce the concept of link-irregular labelings for graphs, extending the notion of link-irregular graphs through edge labeling with positive integers. A labeling is link-irregular if every vertex has a uniquely labeled subgraph…

In this paper, we compute the slice genus for many low-crossing virtual knots. For instance, we show that 1295 out of 92800 virtual knots with 6 or fewer crossings are slice, and that all but 248 of the rest are not slice. Key to these…

We define a knot/link invariant using set theoretical solutions $(X,\sigma)$ of the Yang-Baxter equation and non commutative 2-cocycles. We also define, for a given $(X,\sigma)$, a universal group Unc(X) governing all 2-cocycles in $X$, and…

In this article, we give a list of minimal grid diagrams of the 12 crossing prime alternating knots. This is a continuation of the work in https://doi.org/10.1142/S0218216520500765

We develop a reinforcement learning pipeline for simplifying knot diagrams. A trained agent learns move proposals and a value heuristic for navigating Reidemeister moves. The pipeline applies to arbitrary knots and links; we test it on…

In this paper, we introduce a bisected vertex leveling of a plane graph. Using this planar embedding, we present elementary proofs of the well-known upper bounds in terms of the minimal crossing number on braid index $b(L)$ and arc index…

We study symmetric crossing change operations for strongly invertible knots. Our main theorem is that the most natural notion of equivariant unknotting number is not additive under connected sum, in contrast with the longstanding conjecture…

For links with vanishing pairwise linking numbers, the link components bound pairwise disjoint surfaces in $B^{4}$. In this paper, we describe the set of genera of such surfaces in terms of the $h$-function, which is a link invariant from…

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…

Given any oriented link diagram, one can construct knot invariants using skein relations. Usually such a skein relation contains three or four terms. In this paper, the author introduces several new ways to smooth a crossings, and uses a…

We derive a minimal generating set of planar moves for diagrams of surfaces embedded in the four-space. These diagrams appear as the bonded classical unlink diagrams.

Our main results concern changing an arbitrary plat presentation of a split or composite link to one which is obviously recognizable as being split or composite. Pocket moves, first described in \cite{unlinkviaplats}, are utilized -- a…

Let $k_r(n,\delta)$ be the minimum number of $r$-cliques in graphs with $n$ vertices and minimum degree $\delta$. We evaluate $k_r(n,\delta)$ for $\delta \leq 4n/5$ and some other cases. Moreover, we give a construction, which we conjecture…

We establish a novel connection between algebraic number theory and knot theory. We show that the number of equivalence classes of integral binary quadratic forms of discriminant $t^2 - 4$ (for $t\neq \pm 2$) is equal to the number of…