Related papers: Enumerating the Prime Alternating Knots, Part I
In this paper we use the connected sum operation on knots to show that there is a one-to-one relation between knots and numbers. In this relation prime knots are bijectively assigned with prime numbers such that the prime number 2…
The proliferation of number of processing elements (PEs) in parallel computer systems, along with the use of more extensive parallelization of algorithms causes the interprocessor communications dominate VLSI chip space. This paper proposes…
A knot $K$ is called $(m,n)$-fertile if for every prime knot $K'$ whose crossing number is less than or equal to $m$, there exists an $n$-crossing diagram of $K$ such that one can get $K'$ from the diagram by changing its over-under…
Every tame, prime and alternating knot is equivalent to a tame, prime and alternating knot in regular position, with a common projection. In this work, we show that the Dehn presentation of the knot group of a tame, prime, alternating knot,…
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…
We establish a Kauffman-Murasugi-Thistlethwaite-type theorem for alternating knots in a solid torus. Specifically, we show that any dotted-reduced alternating diagram of a knot in a handlebody realizes the minimal crossing number, and that…
We present a complete classification of spherical knotoids with up to six crossings and conjecture that our classification up to seven crossings is complete. Our work extends the tradition of knot tabulation to the setting of knotoids…
In 1928, Alexander defined a sequence of knot polynomials, D_i(K). The first, D_1(K), is the classical Alexander polynomial. These are easily defined in terms of the homology of the infinite cyclic cover of the knot. In theory they can be…
A recent study characterizing failures in computer networks shows that transient single element (node/link) failures are the dominant failures in large communication networks like the Internet. Thus, having the routing paths globally…
The study of a certain class of matrix integrals can be motivated by their interpretation as counting objects of knot theory such as alternating prime links, tangles or knots. The simplest such model is studied in detail and allows to…
Quasi-alternating links of determinant 1, 2, 3, and 5 were previously classified by Greene and Teragaito, who showed that the only such links are two-bridge. In this paper, we extend this result by showing that all quasi-alternating links…
R. F. Williams showed that all knots in the Lorenz template are prime. His proof included the cases where any number of positive twists were added to one of the template's branches. However, Williams does give an example of a composite knot…
We explore the application of automated reasoning techniques to unknot detection, a classical problem of computational topology. We adopt a two-pronged experimental approach, using a theorem prover to try to establish a positive result…
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…
The concordance genus of a knot K is the minimum three-genus among all knots concordant to K. For prime knots of 10 or fewer crossings there have been three knots for which the concordance genus was unknown. Those three cases are now…
The splitting number of a link is the minimal number of crossing changes between different components required to convert it into a split link. We obtain a lower bound on the splitting number in terms of the (multivariable) signature and…
We study algebraic tangles as fundamental components in knot theory, developing a systematic approach to classify and tabulate prime tangles using a novel canonical representation. The canonical representation enables us to distinguish…
Besides mathematical interest, knots and knot theory have important applications in physics, chemistry, and biology. Stasiak and colleagues devised a constructive method for a knot "energy" using a Metropolis Monte Carlo algorithm to…
Although most knots are nonalternating, modern research in knot theory seems to focus on alternating knots. We consider here nonalternating knots and their properties. Specifically, we show certain classes of knots have nontrivial Jones…
A classical result states that the determinant of an alternating link is equal to the number of spanning trees in a checkerboard graph of an alternating connected projection of the link. We generalize this result to show that the…