Related papers: A note on the weak splitting number
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…
This paper concerns the H(2)-unknotting numbers of links related to 2-bridge links. It consists of three parts. In the first part, we consider a necessary and sufficient condition for a 2-bridge link to have H(2)-unknotting number one. The…
The unknotting number of knots is a difficult quantity to compute, and even its behavior under basic satelliting operations is not understood. We establish a lower bound on the unknotting number of cable knots and iterated cable knots…
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…
New lower bounds on the unknotting number of a knot are constructed from the classical knot signature function. These bounds can be twice as strong as previously known signature bounds. They can also be stronger than known bounds arising…
The simultaneous crossing number is a new knot invariant which is defined for strongly invertible knots having diagrams with two orthogonal transvergent axes of strong inversions. Because the composition of the two inversions gives a cyclic…
The ribbonlength of a link is a geometric invariant defined as the infimum of the ratio of the length to the width of a folded ribbon realization of the link. In this paper, we prove that if an alternating link admits an alternating diagram…
We give a precise estimate for the number of lattice points in certain bounded subsets of $\mathbb{R}^{n}$ that involve `hyperbolic spikes' and occur naturally in multiplicative Diophantine approximation. We use Wilkie's o-minimal structure…
We consider a Schr\"odinger particle on a graph consisting of $\,N\,$ links joined at a single point. Each link supports a real locally integrable potential $\,V_j\,$; the self--adjointness is ensured by the $\,\delta\,$ type boundary…
Link weights are the principal parameters of shortest path routing protocols, the most commonly used protocols for IP networks. The problem of optimally setting link weights for unique shortest path routing is addressed. Due to the…
The warping degree of an oriented knot diagram is the minimal number of crossing changes which are required to obtain a monotone knot diagram from the diagram. The minimal warping degree of a knot is the minimal value of the warping degree…
We use the knot homology of Khovanov and Lee to construct link concordance invariants generalizing the Rasmussen $s$-invariant of knots. The relevant invariant for a link is a filtration on a vector space of dimension $2^{|L|}$. The basic…
For a word w in the braid group on n-strands, we denote by T_w the corresponding transverse braid in the rotational symmetric tight contact structure on S^3. We exhibit a map on link Floer homology which sends the transverse invariant…
The smallest known example of a family of modular categories that is not determined by its modular data are the rank 49 categories $\mathcal{Z}(\text{Vec}_G^{\omega})$ for $G=\mathbb{Z}_{11} \rtimes \mathbb{Z}_{5}$. However, these…
Clustering a signed graph means partitioning the vertices into sets ("clusters") so that every positive edge, and no negative edge, is within a cluster. Clustering is not always possible; the obstruction is circles with exactly one negative…
It is known that the arc index of alternating knots is the minimal crossing number plus two and the arc index of prime nonalternating knots is less than or equal to the minimal crossing number. We study some cases when the arc index is…
The crossing number of a graph is the minimum number of edge crossings that a graph can have when drawn in the plane. Determining this number, known as the Crossing Number problem, is a celebrated problem in combinatorial optimization. It…
Deformations of knots and links in ambient space can be studied combinatorially on their diagrams via local modifications called Reidemeister moves. While it is well-known that, in order to move between equivalent diagrams with Reidemeister…
For a set of non-negative integers $L$, the $L$-intersection number of a graph is the smallest number $l$ for which there is an assignment on the vertices to subsets $A_v \subseteq \{1,\dots, l\}$, such that every two vertices $u,v$ are…
The twisting number of a ribbon knot $K$ is the minimal number of tangle replacements on the symmetry axis of $J \# -J$ for any knot $J$ that is required to produce a symmetric union diagram of $K$. We prove that the twisting number is…