Related papers: Petal Projections, Knot Colorings and Determinants
The colored Jones polynomial is a knot invariant that plays a central role in low dimensional topology. We give a simple and an efficient algorithm to compute the colored Jones polynomial of any knot. Our algorithm utilizes the walks along…
This is the third paper in a series devoted to enumerating the prime alternating knots and links. This paper establishes a method for enumerating the prime alternating links. It is shown that one may choose any prime alternating link…
In this paper, we study knot diagrams for which the underlying graph has treewidth two. We give a linear time algorithm for the following problem: given a knot diagram of treewidth two, does it represent the unknot? We also show that for a…
Bootstrap percolation on a graph with infection threshold $r\in \mathbb{N}$ is an infection process, which starts from a set of initially infected vertices and in each step every vertex with at least $r$ infected neighbours becomes…
We consider upward-planar layered drawings of directed graphs, i.e., crossing-free drawings in which each edge is drawn as a y-monotone curve going upward from its tail to its head, and the y-coordinates of the vertices are integers. The…
We show that for genus one knots the Alexander polynomial and the homology of the double cover branching over the knot provide obstructions to cosmetic crossings. As an application we prove the nugatory crossing conjecture for the…
This is the first in a series of four papers wherein we enumerate all prime alternating knots and links. In this first paper, we introduce four operators on knots and show that, when used according to very simple rules on the prime…
The list of knots with up to 10 crossings is commonly referred to as the Rolfsen Table. This paper presents a way to generate the Rolfsen table in a simple, clear, and reproducible manner. The methods we use are similar to those used by J.…
The present paper is concerned with the enumeration of the state diagrams for some classes of knot shadows endowed with the usual connected sum operation. We focus on shadows that are recursively generated by knot shadows with up to 3…
We introduce a method of computing biquandle brackets of oriented knots and links using a type of decorated trivalent spatial graphs we call trace diagrams. We identify algebraic conditions on the biquandle bracket coefficients for moving…
The distribution of distances in the star graph $ST_n$, ($1<n\in\Z$), is established, and subsequently a threaded binary tree is obtained that realizes an orientation of $ST_n$ whose levels are given by the distances to the identity…
Accessibility percolation is a new type of percolation problem inspired by evolutionary biology. To each vertex of a graph a random number is assigned and a path through the graph is called accessible if all numbers along the path are in…
A model named `Colored Percolation' has been introduced with its infinite number of versions in two dimensions. The sites of a regular lattice are randomly occupied with probability $p$ and are then colored by one of the $n$ distinct colors…
The spectral projectors method is a way to obtain a theoretically well posed definition of the topological susceptibility on the lattice. Up to now this method has been defined and applied only to Wilson fermions. The goal of this work is…
In this paper we discuss the applications of knotoids to modelling knots in open curves and produce new knotoid invariants. We show how invariants of knotoids generally give rise to well-behaved measures of how much an open curve is…
The "necklace process", a procedure constructing necklaces of black and white beads by randomly choosing positions to insert new beads (whose color is uniquely determined based on the chosen location), is revisited. This article illustrates…
We give the bridge indices for 11-crossing prime knots and give a minimal bridge projection for each of these knots. The results on the indices may be easily summarized: all of these knots that are not rational knots or Montesinos knots…
A {\it stuck knot} is a knot diagram containing designated crossings, called {\it stuck crossings}, whose incident strands are required to remain locally non-separable. These rigidity constraints restrict the allowable ambient isotopies and…
We define a map between the set of permutations that avoid either the four patterns $3214,3241,4213,4231$ or $3124,3142,4123,4132$, and the set of Dyck prefixes. This map, when restricted to either of the two classes, turns out to be a…
We present an enhanced prime decomposition theorem for knots that gives the isotopy classes of composite knots that can be constructed from a given list of prime factors (allowing for the mirroring and orientation reversing for each…