Related papers: Low complexity algorithms in knot theory
If a knot has the Alexander polynomial not equal to 1, then it is linear $n$-colorable. By means of such a coloring, such a knot is given an upper bound for the minimal quandle order, i.e., the minimal order of a quandle with which the knot…
Unknot recognition is one of the fundamental questions in low dimensional topology. In this work, we show that this problem can be encoded as a validity problem in the existential fragment of the first-order theory of real closed fields.…
We give infinitely many examples of 2-bridge knots for which the topological and smooth slice genera differ. The smallest of these is the 12-crossing knot $12a255$. These also provide the first known examples of alternating knots for which…
This paper aims to better understand the link better understand the links between aperiodicity in subshifts and pattern complexity. Our main contribution deals with substitutive subshifts, an equivalent to substitutive tilings in the…
This paper contains linear systems of equations which can distinguish knots without knot invariants. Let $M_n$ be the topological moduli space of all n-component string links and such that a fixed projection into the plane is an immersion.…
We consider a variant of the planted clique problem where we are allowed unbounded computational time but can only investigate a small part of the graph by adaptive edge queries. We determine (up to logarithmic factors) the number of…
We study spectral gaps of cellular differentials for finite cyclic coverings of knot complements. Their asymptotics can be expressed in terms of irrationality exponents associated with ratios of logarithms of algebraic numbers determined by…
Let $M_n$ be the topological moduli space of all parallel n-cables of long framed oriented knots in 3-space. We construct in a combinatorial way for each natural number $n>1$ a 1-cocycle $R_n$ which represents a non trivial class in…
The quantum query complexity of subgraph-containment problems, which ask whether a given subgraph $H$ is present in an input graph $G$, has been the subject of considerable study. However, even for relatively simple subgraphs, such as paths…
Our concern is the data complexity of answering linear monadic datalog queries whose atoms in the rule bodies can be prefixed by operators of linear temporal logic LTL. We first observe that, for data complexity, answering any connected…
We consider the complexity of finding weighted homomorphisms from intersection graphs of curves (string graphs) with $n$ vertices to a fixed graph $H$. We provide a complete dichotomy for the problem: if $H$ has no two vertices sharing two…
We establish a connection between knot theory and cluster algebras via representation theory. To every knot diagram (or link diagram), we associate a cluster algebra by constructing a quiver with potential. The rank of the cluster algebra…
We define a notion of complexity for shake-slice knots which is analogous to the definition of complexity for h-cobordisms studied by Morgan-Szab\'o. We prove that for each framing $n \ne 0$ and complexity $c \ge 0$, there is an…
In this note we investigate the role of Lloyd's computational bound in holographic complexity. Our goal is to translate the assumptions behind Lloyd's proof into the bulk language. In particular, we discuss the distinction between…
Classifying the topology of closed curves is a central problem in low dimensional topology with applications beyond mathematics spanning protein folding, polymer physics and even magnetohydrodynamics. The central problem is how to determine…
We describe a percolation problem on lattices (graphs, networks), with edge weights drawn from disorder distributions that allow for weights (or distances) of either sign, i.e. including negative weights. We are interested whether there are…
We consider a class of pattern matching problems where a normalising transformation is applied at every alignment. Normalised pattern matching plays a key role in fields as diverse as image processing and musical information processing…
The contents of this 6-page paper have been subsumed into the 13-page paper, "A note on closed 3-braids", arXiv:0802.1072 [math.GT]. This paper is correct, but contains less information than the new one. The topological classification of…
In this work, we develop the low-space Massively Parallel Computation (MPC) complexity landscape for a family of fundamental graph problems on trees. We present a general method that solves most locally checkable labeling (LCL) problems…
We demonstrate some lower bounds for parameterized problems via parameterized classes corresponding to the classical ${\rm AC}^0$. Among others, we derive such a lower bound for all fpt-approximations of the parameterized clique problem and…