Related papers: Computing a Knot Invariant as a Constraint Satisfa…
The quest for quantum computers is motivated by their potential for solving problems that defy existing, classical, computers. The theory of computational complexity, one of the crown jewels of computer science, provides a rigorous…
Knotted molecules occur naturally and are designed by scientists to gain special biological and material properties. Understanding and utilizing knotting require efficient methods to recognize and generate knotted structures, which are…
In this sequel to my previous paper, "Is String Theory in Knots?" I explore ways of constructing symmetries through an algebraic stepping process using knotted graphs. The hope is that this may lead to an algebraic formulation of string…
Symplectic invariants introduced in math-ph/0702045 can be computed for an arbitrary spectral curve. For some examples of spectral curves, those invariants can solve loop equations of matrix integrals, and many problems of enumerative…
We consider Open Gromov-Witten invariants for noncompact Calabi-Yau in the case the Lagrangian has the topology of $\R^2 \times S^1$. The definition of the invariant involves the choice of a frame for the Lagrangian, in accord with string…
The colored Jones function of a knot is a sequence of Laurent polynomials in one variable, whose n-th term is the Jones polynomial of the knot colored with the n-dimensional irreducible representation of SL(2). It was recently shown by TTQ…
This paper draws on diverse areas of computer science to develop a unified view of computation: (1) Optimization in operations research, where a numerical objective function is maximized under constraints, is generalized from the numerical…
We examine computer experiments that can be performed to understand the dynamics of knots under self-repulsion. In the course of specific computer exploration we use the knot theory of rational knots and rational tangles to produce classes…
We extend knot contact homology to a theory over the ring $\mathbb{Z}[\lambda^{\pm 1},\mu^{\pm 1}]$, with the invariant given topologically and combinatorially. The improved invariant, which is defined for framed knots in $S^3$ and can be…
We develop an invariant of knots that depends on a complex parameter t, describing a left ideal in the noncommutative torus. When the parameter is set equal to -1 we recover the A-polynomial of the knot. We relate the invariant to the…
The expectation value of Wilson loop operators in three-dimensional SO(N) Chern-Simons gauge theory gives a known knot invariant: the Kauffman polynomial. Here this result is derived, at the first order, via a simple variational method.…
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…
In mathematics there is a wide class of knot invariants that may be expressed in the form of multiple line integrals computed along the trajectory C describing the spatial conformation of the knot. In this work it is addressed the problem…
This work identifies a class of moves on knots which translate to $m$-equivalences of the associated $p$-fold branched cyclic covers, for a fixed $m$ and any $p$ (with respect to the Goussarov-Habiro filtration.) These moves are applied to…
We prove that deciding if a diagram of the unknot can be untangled using at most $k$ Riedemeister moves (where $k$ is part of the input) is NP-hard. We also prove that several natural questions regarding links in the $3$-sphere are NP-hard,…
The most tight conformations of prime knots are found with the use of the SONO algorithm. Their curvature and torsion profiles are calculated. Symmetry of the knots is analysed. Connections with the physics of polymers are discussed.
In 1999, Khovanov showed that a link invariant known as the Jones polynomial is the Euler characteristic of a homology theory. The knot categorification problem is to find a general construction of knot homology groups, and to explain their…
This paper discusses some geometric ideas associated with knots in real projective 3-space $\mathbb{R}P^3$. These ideas are borrowed from classical knot theory. Since knots in $\mathbb{R}P^3$ are classified into three disjoint classes, -…
Compared with constraint satisfaction problems, counting problems have received less attention. In this paper, we survey research works on the problems of counting the number of solutions to constraints. The constraints may take various…
What makes a computational problem easy (e.g., in P, that is, solvable in polynomial time) or hard (e.g., NP-hard)? This fundamental question now has a satisfactory answer for a quite broad class of computational problems, so called…