Related papers: The Braid Index Of Reduced Alternating Links
In an earlier note [arXiv:2301.00295] it was shown that there is an upper bound to the number of disjoint Hopf links (and certain related links) that can be embedded in the unit cube where there is a fixed separation required between the…
If the twist numbers of a collection of oriented alternating link diagrams are bounded, then the Alexander polynomials of the corresponding links have bounded euclidean Mahler measure (see Definition 1.2). The converse assertion does not…
The altenating knots, links and twists projected on the S_2 sphere are identified with the phase Space of a Hamiltonian dynamic system of one degree of freedom. The saddles of the system correspond to the crossing points, the edges, to the…
We introduce stable equivalence classes of oriented links in orientable three-manifolds that are orientation $I$-bundles over closed but not necessarily orientable surfaces. We call these twisted links, and show that they subsume the…
Frequently, knots are enumerated by their crossing number. However, the number of knots with crossing number $c$ grows exponentially with $c$, and to date computer-assisted proofs can only classify diagrams up to around twenty crossings.…
A well-known algorithm for unknotting knots involves traversing a knot diagram and changing each crossing that is first encountered from below. The minimal number of crossings changed in this way across all diagrams for a knot is called the…
Cromwell proved that the minimum $v$-degree of the HOMFLY polynomial of homogeneous link $L$ is bounded above by $1-\chi(L)$, where $\chi(L)$ is the maximum Euler characteristic of Seifert surfaces of $L$. We prove its slice version,…
In this paper we describe braid equivalence for knots and links in a 3-manifold $M$ obtained by rational surgery along a framed link in $S^3$. We first prove a sharpened version of the Reidemeister theorem for links in $M$. We then give…
The atom-bond connectivity (ABC) index is one of the most investigated degree-based molecular structure descriptors with a variety of chemical applications. It is known that among all connected graphs, the trees minimize the ABC index.…
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
The linking number is the simplest link invariant given by Gauss; it is the first Gauss diagram formula expressed by one arrow among two circles. Proceeding the next stage, we study the second Gauss diagram formula consisting of two arrows…
A delta-move is a local move on a link diagram. The delta-Gordian distance between links measures the minimum number of delta-moves needed to move between link diagrams. A self delta-move only involves a single component of a link whereas a…
The vertex connectivity of a graph $G$ is the size of the smallest set of vertices $S$ such that $G \setminus S$ is disconnected. For the class of planar graphs, the problem of vertex connectivity is well-studied, both from structural and…
Twisted torus links are given by twisting a subset of strands on a closed braid representative of a torus link. T--links are a natural generalization, given by repeated positive twisting. We establish a one-to-one correspondence between…
Two new invariants that are closely related to Milnor's curvature-torsion invariant are introduced. The first, the spiral index of a knot, captures the minimum number of maxima among all knot projections that are free of inflection points.…
In this paper we characterize the unique graph whose algebraic connectivity is minimum among all connected graphs with given order and fixed matching number or edge covering number, and present two lower bounds for the algebraic…
Minimizing the weight of an edge set satisfying parity constraints is a challenging branch of combinatorial optimization as witnessed by the binary hypergraph chapter of Alexander Schrijver's book ``Combinatorial Optimization" (Chapter 80).…
We give a complete proof of results announced by Hirasawa and Sakuma describing explicitly the Kakimizu complex of a non-split, prime, special, alternating link.
This paper considers the edge-connectivity and restricted edge-connectivity of replacement product graphs, gives some bounds on edge-connectivity and restricted edge-connectivity of replacement product graphs and determines the exact values…
It is known that the minimum broadcast rate of a linear index code over $\mathbb{F}_q$ is equal to the $minrank_q$ of the underlying digraph. In [3] it is proved that for $\mathbb{F}_2$ and any positive integer $k$, $minrank_q(G)\leq k$ iff…