Related papers: Parameterized complexity of quantum invariants
Quantum topological invariants have played an important role in computational topology, and they are at the heart of major modern mathematical conjectures. In this article, we study the experimental problem of computing large $r$ values of…
We give diagrammatic algorithms for computing the group trisection, homology groups, and intersection form of a closed, orientable, smooth 4-manifold, presented as a branched cover of a bridge-trisected surface in $\mathbb{S}^{4}$. The…
We introduce new skein invariants of links based on a procedure where we first apply the skein relation only to crossings of distinct components, so as to produce collections of unlinked knots. We then evaluate the resulting knots using a…
We establish a system of PDE, called open WDVV, that constrains the bulk-deformed superpotential and associated open Gromov-Witten invariants of a Lagrangian submanifold $L \subset X$ with a bounding chain. Simultaneously, we define the…
We propose a new (theoretical) computational model for the study of massive data processing with limited computational resources. Our model measures the complexity of reading the very large data sets in terms of the data size N and analyzes…
We present randomized algorithms for some well-studied, hard combinatorial problems: the k-path problem, the p-packing of q-sets problem, and the q-dimensional p-matching problem. Our algorithms solve these problems with high probability in…
The three-in-a-tree problem asks for an induced tree of the input graph containing three mandatory vertices. In 2006, Chudnovsky and Seymour [Combinatorica, 2010] presented the first polynomial time algorithm for this problem, which has…
Pulling back the weight system associated with the exceptional Lie algebra G_2 by a modification of the universal Vassiliev-Kontsevich invariant yields a link invariant; extending it to 3-nets, we derive a recursive algorithm for its…
The starting point of our work is a decade-old open question concerning the subexponential parameterized complexity of \textsc{2-Layer Crossing Minimization}. In this problem, the input is an $n$-vertex graph $G$ whose vertices are…
The synthesis of classical Computational Complexity Theory with Recursive Analysis provides a quantitative foundation to reliable numerics. Here the operators of maximization, integration, and solving ordinary differential equations are…
We find approximations by Vassiliev invariants for the coefficients of the Jones polynomial and all specializations of the HOMFLY and Kauffman polynomials. Consequently, we obtain approximations of some other link invariants arising from…
This is part 2 of a 3-part article where we provide an $O(n^2)$-algorithm to produce a surgery presentation of a 3-manifold induced by a gem with a resolution. In this part we produce a sequence of colored simplicial 2-complexes which are…
We give a purely topological definition of the perturbative quantum invariants of links and 3-manifolds associated with Chern-Simons field theory. Our definition is as close as possible to one given by Kontsevich. We will also establish…
The Turaev-Viro invariants are scalar topological invariants of compact, orientable 3-manifolds. We give a quantum algorithm for additively approximating Turaev-Viro invariants of a manifold presented by a Heegaard splitting. The algorithm…
A perturbative expansion of knot invariants is derived using quantum cluster algebras. By interpreting the $R$-matrix of $U_q(\mathfrak{sl}_2)$ as a cluster transformation and introducing an auxiliary parameter $\epsilon$, we derive a…
$O(N)$ invariants are the observables of real tensor models. We use regular colored graphs to represent these invariants, the valence of the vertices of the graphs relates to the tensor rank. We enumerate $O(N)$ invariants as $d$-regular…
We use the relation between the quantum su(2) R-matrix and the Burau representation of the braid group in order to study the structure of the colored Jones polynomial of links. We show that similarly to the case of a knot, the colored Jones…
Recently, a plethora of multivariable knot polynomials were introduced by Kashaev and one of the authors, by applying the Reshetikhin-Turaev functor to rigid $R$-matrices that come from braided Hopf algebras with automorphisms. We study the…
Motivated by algorithmic problems arising in quantum field theories whose dynamical variables are geometric in nature, we provide a quantum algorithm that efficiently approximates the colored Jones polynomial. The construction is based on…
Using Bar-Natan's Khovanov homology we define a homology theory for coloured, oriented, framed links. We then compute this explicitly.