Related papers: Parameterized complexity of quantum invariants
The ribbon cocycle invariant is defined by means of a partition function using ternary cohomology of self-distributive structures (TSD) and colorings of ribbon diagrams of a framed link, following the same paradigm introduced by Carter,…
The link invariant, arising from the cyclic quantum dilogarithm via the particular $R$-matrix construction, is proved to coincide with the invariant of triangulated links in $S^3$ introduced in R.M. Kashaev, Mod. Phys. Lett. A, Vol.9 No.40…
In this paper, we consider the parameterized quantum query complexity for graph problems. We design parameterized quantum query algorithms for $k$-vertex cover and $k$-matching problems, and present lower bounds on the parameterized quantum…
For a virtual knot $K$ and an integer $r$ with $r\geq2$, we introduce a method of constructing an $r$-component virtual link $L(K;r)$, which we call the $r$-multiplexing of $K$. Every invariant of $L(K;r)$ is an invariant of $K$. We give a…
A formula for the Arf invariant of a link is given in terms of the singularities of an immersed surface bounded by the link. This is applied to study the computational complexity of quantum invariants of 3--manifolds.
We introduce a general method for obtaining fixed-parameter algorithms for problems about finding paths in undirected graphs, where the length of the path could be unbounded in the parameter. The first application of our method is as…
The symmetric $\mathfrak{gl}_n$-homologies, introduced by Robert and Wagner, provide a categorification of the Reshetikhin--Turaev invariants corresponding to symmetric powers of the standard representation of quantum $\mathfrak{gl}_n$.…
In the Colored Clustering problem, one is asked to cluster edge-colored (hyper-)graphs whose colors represent interaction types. More specifically, the goal is to select as many edges as possible without choosing two edges that share an…
We study a probabilistic variant of the r-th sequential parametrized topological complexity, which bounds this classical invariant from below and measures the difficulty in constructing permissive parametrized motion planning algorithms. On…
We study the parameterized complexity of the following fundamental geometric problems with respect to the dimension $d$: i) Given $n$ points in $\Rd$, compute their minimum enclosing cylinder. ii) Given two $n$-point sets in $\Rd$, decide…
Turaev Viro invariants are amongst the most powerful tools to distinguish 3-manifolds: They are implemented in mathematical software, and allow practical computations. The invariants can be computed purely combinatorially by enumerating…
The cyclability of a graph is the maximum integer $k$ for which every $k$ vertices lie on a cycle. The algorithmic version of the problem, given a graph $G$ and a non-negative integer $k,$ decide whether the cyclability of $G$ is at least…
We study the design of fixed-parameter algorithms for problems already known to be solvable in polynomial time. The main motivation is to get more efficient algorithms for problems with unattractive polynomial running times. Here, we focus…
We show how the multivariable signature and Alexander polynomial of a colored link can be computed from a single symmetric matrix naturally defined from a colored link diagram. In the case of a single variable, it coincides with the matrix…
We propose a gauge model of quantum electrodynamics (QED) and its nonabelian generalization from which we derive knot invariants such as the Jones polynomial. Our approach is inspired by the work of Witten who derived knot invariants from…
In this paper, we construct quantum invariants for knotoid diagrams in $\mathbb{R}^2$. The diagrams are arranged with respect to a given direction in the plane ({\it Morse knotoids}). A Morse knotoid diagram can be decomposed into basic…
We have recently proposed arXiv:2105.11565 a powerful method for computing group factors of the perturbative series expansion of the Wilson loop in the Chern-Simons theory with $SU(N)$ gauge group. In this paper, we apply the developed…
In this paper, we define some polynomial invariants for virtual knots and links. In the first part we use Manturov's parity axioms to obtain a new polynomial invariant of virtual knots. This invariant can be regarded as a generalization of…
We introduce the Non-commutative Subset Convolution - a convolution of functions useful when working with determinant-based algorithms. In order to compute it efficiently, we take advantage of Clifford algebras, a generalization of…
Given any unoriented link diagram, a group of new knot invariants are constructed. Each of them satisfies a generalized 4 term skein relation. The coefficients of each invariant is from a commutative ring. Homomorphisms and representations…