Related papers: Parameterized complexity of quantum invariants
In this article we develop a graphical calculus for stable invariants of Riemannian manifolds akin to the graphical calculus for Rozansky-Witten invariants for hyperk\"ahler manifolds; based on interpreting trivalent graphs with colored…
We describe an efficient algorithm to compute finite type invariants of type $k$ by first creating, for a given knot $K$ with $n$ crossings, a look-up table for all subdiagrams of $K$ of size $\lceil \frac{k}{2}\rceil$ indexed by dyadic…
It is known that the writhe calculated from any reduced alternating link diagram of the same (alternating) link has the same value. That is, it is a link invariant if we restrict ourselves to reduced alternating link diagrams. This is due…
In this paper, we provide an $O(n \mathrm{polylog} n)$ bound on the expected complexity of the randomly weighted Voronoi diagram of a set of $n$ sites in the plane, where the sites can be either points, interior-disjoint convex sets, or…
Vassiliev's knot invariants can be computed in different ways but many of them as Kontsevich integral are very difficult. We consider more visual diagram formulas of the type Polyak-Viro and give new diagram formula for the two basic…
We show how to define invariants of graphs related to quantum $\mathfrak{sl}(2)$ when the graph has more then one connected component and components are colored by blocks of representations with zero quantum dimensions.
An elementary introduction to knot theory and its link to quantum field theory is presented with an intention to provide details of some basic calculations in the subject, which are not easily found in texts. Study of Chern-Simons theory…
We answer the following question posed by Lechuga: Given a simply-connected space $X$ with both $H_*(X,\qq)$ and $\pi_*(X)\otimes \qq$ being finite-dimensional, what is the computational complexity of an algorithm computing the cup-length…
Kashaev and Reshetikhin previously described a way to define holonomy invariants of knots using quantum $\mathfrak{sl}_2$ at a root of unity. These are generalized quantum invariants depend both on a knot $K$ and a representation of the…
The aim of this paper is to define two link invariants satisfying cubic skein relations. In the hierarchy of polynomial invariants determined by explicit skein relations they are the next level of complexity after Jones, HOMFLY, Kauffman…
One of the apparent advantages of quantum computers over their classical counterparts is their ability to efficiently contract tensor networks. In this article, we study some implications of this fact in the case of topological tensor…
Colored HOMFLY-PT invariant, the generalization of the colored Jones polynomial, is one of the most important quantum invariants of links. This paper is devoted to investigating the basic structures of the colored HOMFLY-PT invariants of…
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…
We study a quantum version of the $n$-dimer model from statistical mechanics, based on the formalism from quantum topology developed by Reshetikhin and Turaev (the latter which, in particular, can be used to construct the Jones polynomial…
The Reshetikhin - Turaeve approach to topological invariants of three - manifolds is generalized to quantum supergroups. A general method for constructing three - manifold invariants is developed, which requires only the study of the…
We provide a geometric construction of the boundary states for handlebodies which we in turn use to give a geometric formula for the Witten-Reshetikhin-Turaev quantum invariants. We then analyze the asymptotics of this invariant in the…
The purpose of this paper is to construct and study equivariant Khovanov homology - a version of Khovanov homology theory for periodic links. Since our construction works regardless of the characteristic of the coefficient ring it…
In this paper, we reconstruct Kuperberg's $G_2$ web space. We introduce a new web (a trivalent diagram) and new relations between Kuperberg's web diagrams and the new diagram. Using the $G_2$ webs, we define crossing formulas corresponding…
We present three new quantum algorithms in the quantum query model for \textsc{graph-collision} problem: \begin{itemize} \item an algorithm based on tree decomposition that uses $O\left(\sqrt{n}t^{\sfrac{1}{6}}\right)$ queries where $t$ is…
The multivariable Conway function is generalized to oriented framed trivalent graphs equipped with additional structure (coloring). This is done via refinements of Reshetikhin-Turaev functors based on irreducible representations of…