Related papers: A combinatorial approach to knot recognition
This paper visualizes a knot reduction algorithm
We describe a normal surface algorithm that decides whether a knot, with known degree of the colored Jones polynomial, satisfies the Strong Slope Conjecture. We also discuss possible simplifications of our algorithm and state related open…
Knots, links and entangled filaments appear in many physical systems of interest in biology and engineering. Classifying knots and measuring entanglement is of interest both for advancing knot theory, as well as for analyzing large data…
It is a major unsolved problem as to whether unknot recognition - that is, testing whether a given closed loop in R^3 can be untangled to form a plain circle - has a polynomial time algorithm. In practice, trivial knots (which can be…
A combinatorial methods are used to investigate some properties of certain generalized Stirling numbers, including explicit formula and recurrence relations. Furthermore, an expression of these numbers with symmetric function is deduced.
Node coloring is the task of assigning colors to the nodes of a graph such that no two adjacent nodes have the same color, while using as few colors as possible. It is the most widely studied instance of graph coloring and of central…
For p=3 and for p=5 we prove that there are exactly p equivalence classes of p-coloured knots modulo (+/-1)--framed surgeries along unknots in the kernel of a p-colouring. These equivalence classes are represented by connect-sums of n…
This paper introduces a new algebra, the crossing algebra, that is applied to count the number of components for arborescent knots, links, tangles or states (of a state polynomial expansion such as the Kauffman bracket). This algebra is…
The AJ Conjecture relates a quantum invariant, a minimal order recursion for the colored Jones polynomial of a knot (known as the $\hat{A}$ polynomial), with a classical invariant, namely the defining polynomial $A$ of the $\psl$ character…
In generalization of knot quandles we introduce similar algebraic structures associated with arbitrary pairs consisting of a path-connected topological space and its path-connected subspace.
In this paper we give two new criteria of detecting the checkerboard colorability of virtual links by using odd writhe and arrow polynomial of virtual links, respectively. By applying new criteria, we prove that 6 virtual knots are not…
We study the following combinatorial problem. Given a set of $n$ y-monotone curves, which we call wires, a tangle determines the order of the wires on a number of horizontal layers such that any two consecutive layers differ only in swaps…
We study colored coverage and clustering problems. Here, we are given a colored point set where the points are covered by (unknown) $k$ clusters, which are monochromatic (i.e., all the points covered by the same cluster, have the same…
We consider braids with repeating patterns inside arbitrary knots which provides a multi-parametric family of knots, depending on the "evolution" parameter, which controls the number of repetitions. The dependence of knot (super)polynomials…
Three new knot invariants are defined using cocycles of the generalized quandle homology theory that was proposed by Andruskiewitsch and Gra\~na. We specialize that theory to the case when there is a group action on the coefficients. First,…
The Slope Conjecture relates the degree of the colored Jones polynomial of a knot to boundary slopes of incompressible surfaces. Our aim is to prove the Slope Conjecture for Montesinos knots, and to match parameters of a state-formula for…
The vertex coloring problem to find chromatic numbers is known to be unsolvable in polynomial time. Although various algorithms have been proposed to efficiently compute chromatic numbers, they tend to take an enormous amount of time for…
In this paper we describe a new method for detecting and counting a repeating object in an image. While the method relies on a fairly sophisticated deformable part model, unlike existing techniques it estimates the model parameters in an…
Virtual knot theory is a generalization (discovered by the author in 1996) of knot theory to the study of all oriented Gauss codes. (Classical knot theory is a study of planar Gauss codes.) Graph theory studies non-planar graphs via…
We develop a word mechanism applied in knot and link diagrams for the illustration of a diagrammatic property. We also give a necessary condition for determining incompressible and pairwise incompressible surfaces, that are embedded in knot…