Related papers: The Computational Complexity of Knot and Link Prob…
For $\ell >1$, we develop $L^{(2)}$-signature obstructions for $(4\ell-3)$-dimensional knots with metabelian knot groups to be doubly slice. For each $\ell>1$, we construct an infinite family of knots on which our obstructions are non-zero,…
We define the knotting probability of a knot $K$ by the probability for a random polygon (RP) or self-avoiding polygon (SAP) of $N$ segments having the knot type $K$. We show fundamental and generic properties of the knotting probability…
The crosscap number of a knot is an invariant describing the non-orientable surface of smallest genus that the knot bounds. Unlike knot genus (its orientable counterpart), crosscap numbers are difficult to compute and no general algorithm…
We show that the problem to decide whether two (convex) polytopes, given by their vertex-facet incidences, are combinatorially isomorphic is graph isomorphism complete, even for simple or simplicial polytopes. On the other hand, we give a…
Knot theory is a study of the embedding of closed circles into three-dimensional Euclidean space, motivated the ubiquity of knots in daily life and human civilization. However, the current knot theory focuses on the topology rather than…
Planarity Testing is the problem of determining whether a given graph is planar while planar embedding is the corresponding construction problem. The bounded space complexity of these problems has been determined to be exactly Logspace by…
The main goal of this paper is to prove that for odd free knots - that is free knots with all odd crossings - the problem of sliceness (the existence of a spanning disc) has an explicit answer based on the pairing of the knot diagram…
In this paper, we study knot diagrams for which the underlying graph has treewidth two. We give a linear time algorithm for the following problem: given a knot diagram of treewidth two, does it represent the unknot? We also show that for a…
We study several related models of self-avoiding polygons in a tubular subgraph of the simple cubic lattice, with a particular interest in the asymptotics of the knotting statistics. Polygons in a tube can be characterised by a finite…
Introducing a way to modify knots using $n$-trivial rational tangles, we show that knots with given values of Vassiliev invariants of bounded degree can have arbitrary unknotting number (extending a recent result of Ohyama, Taniyama and…
Many discrete optimization problems amount to selecting a feasible set of edges of least weight. We consider in this paper the context of spatial graphs where the positions of the vertices are uncertain and belong to known uncertainty sets.…
Knot theory is actively studied both by physicists and mathematicians as it provides a connecting centerpiece for many physical and mathematical theories. One of the challenging problems in knot theory is distinguishing mutant knots. Mutant…
We study the polyhedral properties of three problems of constructing an optimal complete bipartite subgraph (a biclique) in a bipartite graph. In the first problem we consider a balanced biclique with the same number of vertices in both…
We classify nonnegatively curved simply connected 4-manifolds with circle symmetry up to equivariant diffeomorphisms. The main problem is rule out knotted curves in the singular set of the orbit space. As an extension of this work we…
The geometric bottleneck Steiner network problem on a set of vertices $X$ embedded in a normed plane requires one to construct a graph $G$ spanning $X$ and a variable set of $k\geq 0$ additional points, such that the length of the longest…
We give two different, statistically consistent definitions of the length l of a prime knot tied into a polymer ring. In the good solvent regime the polymer is modelled by a self avoiding polygon of N steps on cubic lattice and l is the…
Let $D$ be a diagram of an alternating knot with unknotting number one. The branched double cover of $S^3$ branched over $D$ is an L-space obtained by half integral surgery on a knot $K_D$. We denote the set of all such knots $K_D$ by…
We develop a word mechanism applied in knot and link diagrams for the illustration of a diagrammatic property. We also give a necessary condition for determining incompressible and pairwise incompressible surfaces, that are embedded in knot…
We introduce a new real-valued invariant called the natural slope of a hyperbolic knot in the 3-sphere, which is defined in terms of its cusp geometry. We show that twice the knot signature and the natural slope differ by at most a constant…
The first algorithm for sampling the space of thick equilateral knots, as a function of thickness, will be described. This algorithm is based on previous algorithms of applying random reflections. To prove the existence of the algorithm, we…