Related papers: Knot Colorings: Coloring and Goeritz matrices
We show, without using the Four Color Theorem, that for each planar triangulation, the number of its proper vertex colorings by 4 colors is a determinant and thus can be calculated in a polynomial time. In particular, we can efficiently…
The unknotting number of a positive braid with n strands and k intersections is known to be equal to (k-n+1)/2. We consider Lorenz knots (which are positive braids) and, using a different method, find their unknotting numbers in terms of…
The fundamental problem of knot theory is to know whether two knots are equivalent or not. As a tool to prove that two knots are different, mathematicians have developed various invariants. Knots invariants are just functions that can be…
We employ the sl(2) foam cohomology to define a cohomology theory for oriented framed tangles whose components are labelled by irreducible representations of U_q(sl(2)). We show that the corresponding colored invariants of tangles can be…
This thesis develops some general calculational techniques for finding the orders of knots in the topological concordance group C. The techniques currently available in the literature are either too theoretical, applying to only a small…
We provide explicit formulas for the Alexander polynomial of pretzel knots and establish several immediate corollaries, including the characterization of pretzel knots with a trivial Alexander polynomial. As an application, we construct a…
We take a close look at a classical magic trick performed with a string, where a trivial knot is seemingly isotoped into a trefoil, and generalize it to a family of magic tricks for transforming the unknot into other knots. We encode such a…
We study inequalities between integer-valued knot invariants arising from classical knot theory, four-dimensional topology, knot homologies, and knot polynomials. We present a directed graph consisting of 48 inequalities between 33 knot…
A new computational technique based on the symbolic description utilizing kneading invariants is proposed and verified for explorations of dynamical and parametric chaos in a few exemplary systems with the Lorenz attractor. The technique…
Recently, Jones introduced a method of constructing knots and links from elements of Thompson's group $F$ by using its unitary representations. He also defined several subgroups of $F$ as the stabilizer subgroups and some researchers…
This short note is about three-stranded pretzel knots that have an even number of crossings in one of the strands. We calculate the braid index of such knots and determine which of them are quasipositive. The main tools are the…
Given any oriented link diagram, one can construct knot invariants using skein relations. Usually such a skein relation contains three or four terms. In this paper, the author introduces several new ways to smooth a crossings, and uses a…
A knot is a circle piecewise-linearly embedded into the 3-sphere. The topology of a knot is intimately related to that of its exterior, which is the complement of an open regular neighborhood of the knot. Knots are typically encoded by…
Using the Hatcher-Oertel algorithm for finding boundary slopes of Montesinos knots, we prove the Slope Conjecture and the Strong Slope Conjecture for a family of 3-tangle pretzel knots. More precisely, we prove that the maximal degrees of…
This paper studies cobordism and concordance for virtual knots. We define the affine index polynomial, prove that it is a concordance invariant for knots and links (explaining when it is defined for links), show that it is also invariant…
We produce a facial state sum on plane diagrams of a knot or a link which admits an invariant specialization under Polyak's recent set of generating of 4 Reidemeister moves. Thus an isotopy invariant of framed links is obtained. Each state…
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…
Squeezed knots are those knots that appear as slices of genus-minimizing oriented smooth cobordisms between positive and negative torus knots. We show that this class of knots is large and discuss how to obstruct squeezedness. The most…
We introduce a relation of cobordism for knots in thickened surfaces and study cobordism invariants of such knots.
Color coding is an algorithmic technique used in parameterized complexity theory to detect "small" structures inside graphs. The idea is to derandomize algorithms that first randomly color a graph and then search for an easily-detectable,…