Related papers: Parameterized complexity of quantum invariants
For a banded link $L$ in a surface times a circle, the Witten-Reshetikhin-Turaev invariants are topological invariants depending on a sequence of complex $2p$-th roots of unity $(A_p)_{p\in 2\mathbb{N}}$. We show that there exists a…
Recent progress in string theory has led to a reformulation of quantum-group polynomial invariants for knots and links into new polynomial invariants whose coefficients can be understood in topological terms. We describe in detail how to…
We show that the eccentricities, diameter, radius, and Wiener index of an undirected $n$-vertex graph with nonnegative edge lengths can be computed in time $O(n\cdot \binom{k+\lceil\log n\rceil}{k} \cdot 2^k k^2 \log n)$, where $k$ is the…
Golovach, Paulusma and Song (Inf. Comput. 2014) asked to determine the parameterized complexity of the following problems parameterized by $k$: (1) Given a graph $G$, a clique modulator $D$ (a clique modulator is a set of vertices, whose…
We show that the Reshetikhin-Turaev-Walker invariant of 3-manifolds can be normalized to obtain an invariant of 4-dimensional thickenings of 2-complexes. Moreover when the underlying semisimple tortile category comes from the…
We show that for any fixed $(2+1)$-dimensional TQFT over $\mathbb{C}$ of either Turaev-Viro-Barrett-Westbury or Reshetikhin-Turaev type, the problem of (exactly) computing its invariants on closed 3-manifolds is either solvable in…
Given a finite dimensional representation of a semisimple Lie algebra there are two ways of constructing link invariants: 1) quantum group invariants using the R-matrix, 2) the Kontsevich universal link invariant followed by the Lie algebra…
The Witten-Reshetikhin-Turaev invariants extend the Jones polynomials of links in S^3 to invariants of links in 3-manifolds. Similarly, in a preceding paper, the authors constructed two 3-manifold invariants N_r and N^0_r which extend the…
We incorporate quandle cocycle information into the quandle coloring quivers we defined in arXiv:1807.10465 to define weighted directed graph-valued invariants of oriented links we call \textit{quandle cocycle quivers}. This construction…
We present the $CWR$ invariant, a new invariant for alternating links, which builds upon and generalizes the $WRP$ invariant. The $CWR$ invariant is an array of two-variable polynomials that provides a stronger invariant compared to the…
In this paper we compare and illustrate the algorithmic use of graphs of bounded tree-width and graphs of bounded clique-width. For this purpose we give polynomial time algorithms for computing the four basic graph parameters independence…
Subexponential parameterized algorithms are known for a wide range of natural problems on planar graphs, but the techniques are usually highly problem specific. The goal of this paper is to introduce a framework for obtaining…
The NP-hard general factor problem asks, given a graph and for each vertex a list of integers, whether the graph has a spanning subgraph where each vertex has a degree that belongs to its assigned list. The problem remains NP-hard even if…
This paper studies the unification problem with associative, commutative, and associative-commutative functions mainly from a viewpoint of the parameterized complexity on the number of variables. It is shown that both associative and…
We continue and extend previous work on the parameterized complexity analysis of the NP-hard Stable Roommates with Ties and Incomplete Lists problem, thereby strengthening earlier results both on the side of parameterized hardness as well…
Recently, Bojikian and Kratsch [2023] have presented a novel approach to tackle connectivity problems parameterized by clique-width ($\operatorname{cw}$), based on counting small representations of partial solutions (modulo two). Using this…
The deletion--contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomials in graph theory, the Jones polynomial of an alternating…
Knot and link polynomials are topological invariants calculated from the expectation value of loop operators in topological field theories. In 3D Chern-Simons theory, these invariants can be found from crossing and braiding matrices of…
We describe an algorithm that can effectively calculate the $s$-invariant of a link as defined by Beliakova and Wehrli. Our computations show that this cannot be done by merely calculating the $E_\infty$-page of the Bar-Natan--Lee--Turner…
We establish a bound of $O(n^2k^{1+\eps})$, for any $\eps>0$, on the combinatorial complexity of the set $\T$ of line transversals of a collection $\P$ of $k$ convex polyhedra in $\reals^3$ with a total of $n$ facets, and present a…