Related papers: Knottedness is in NP, modulo GRH

This thesis develops some general calculational techniques for finding the orders of knots in the topological concordance group C. The techniques currently available in the literature are either too theoretical, applying to only a small…

We show that, for any prime p, a knot K in the 3-sphere is determined by its p-fold cyclic unbranched covering. We also investigate when the m-fold cyclic unbranched covering of a knot coincides with the n-fold cyclic unbranched covering of…

This paper gives infinitely many examples of unknot diagrams that are hard, in the sense that the diagrams need to be made more complicated by Reidemeister moves before they can be simplified. In order to construct these diagrams, we prove…

Let $K$ be a knot with an unknotting tunnel $\gamma$ and suppose that $K$ is not a 2-bridge knot. There is an invariant $\rho = p/q \in \mathbb{Q}/2 \mathbb{Z}$, $p$ odd, defined for the pair $(K, \gamma)$. The invariant $\rho$ has…

We construct new knot polynomials. Let $V$ be the standard solid torus in 3-space and let $pr$ be its standard projection onto an annulus. Let $M$ be the space of all smooth oriented knots in $V$ such that the restriction of $pr$ is an…

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.…

In this article it is proven that if a knot, K, bounds an imbedded grope of class n, then the knot is n/2-trivial in the sense of Gusarov and Stanford. That is, all type n/2 invariants vanish on K. We also give a simple way to construct all…

A graph $G$ is embeddable in $\mathbb{R}^d$ if vertices of $G$ can be assigned with points of $\mathbb{R}^d$ in such a way that all pairs of adjacent vertices are at the distance 1. We show that verifying embeddability of a given graph in…

A classical knot is described by a one-stroke trajectory with entanglements of a string. The replica method appears as a powerful tool in statistical mechanics for a polymer or self-avoiding walk. We consider this replica N to 0 limit in…

Thanks to earlier work of Koiran, it is known that the truth of the Generalized Riemann Hypothesis (GRH) implies that the dimension of algebraic sets over the complex numbers can be determined within the polynomial-hierarchy. The truth of…

We define a broad class of graphs that generalize the Gordian graph of knots. These knot graphs take into account unknotting operations, the concordance relation, and equivalence relations generated by knot invariants. We prove that…

In this paper we investigate the descriptional complexity of knot theoretic problems and show upper bounds for planarity problem of signed and unsigned knot diagrams represented by Gauss words. Since a topological equivalence of knots can…

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 connectivity of a graph is an important parameter to evaluate its reliability. $k$-restricted connectivity (resp. $R^h$-restricted connectivity) of a graph $G$ is the minimum cardinality of a set $S$ of vertices in $G$, if exists, whose…

As it follows from G\"odel's incompleteness theorems, any consistent formal system of axioms and rules of inference should imply a true unprovable statement. Actually, this fundamental principle can be efficiently applicable in…

The graph crossing number problem, cr(G)<=k, asks for a drawing of a graph G in the plane with at most k edge crossings. Although this problem is in general notoriously difficult, it is fixed- parameter tractable for the parameter k…

Let $K\subset S^3$ be a knot, $X:= S^3\setminus K$ its complement, and $\mathbb{T}$ the circle group identified with $\mathbb{R}/\mathbb{Z}$. To any oriented long knot diagram of $K$, we associate a quadratic polynomial in variables…

A polynomial knot is a smooth embedding $\kappa: \real \to \real^n$ whose components are polynomials. The case $n = 3$ is of particular interest. It is both an object of real algebraic geometry as well as being an open ended topological…

We introduce a notion of intrinsic linking and knotting for virtual spatial graphs. Our theory gives two filtrations of the set of all graphs, allowing us to measure, in a sense, how intrinsically linked or knotted a graph is; we show that…

In this paper we study rational real algebraic knots in $\R P^3$. We show that two real algebraic knots of degree $\leq5$ are rigidly isotopic if and only if their degrees and encomplexed writhes are equal. We also show that any irreducible…