Related papers: Proposed Property 2R counterexamples classified

We produce an infinite family of $2$-complexes that are intrinsically linked when embedded into four dimensions. In particular, we show that any embedding into $\mathbb{R}^4$ of the suspension of a graph containing $K_6$ as a minor contains…

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…

It has been conjectured that for knots $K$ and $K'$ in $S^3$, $w(K#K')= w(K)+w(K')-2$. Scharlemann and Thompson have proposed potential counterexamples to this conjecture. For every $n$, they proposed a family of knots ${K^n_i}$ for which…

Let $G$ be a group. If an equation $x^n = y^n$ in $G$ implies $x = y$ for any elements $x$ and $y$, then $G$ is called an $R$--group. It is completely understood which knot groups are $R$--groups. Fay and Walls introduced $\bar{R}$--group…

Given a tame knot K presented in the form of a knot diagram, we show that the problem of determining whether K is knotted is in the complexity class NP, assuming the generalized Riemann hypothesis (GRH). In other words, there exists a…

We prove the Categorified Wrapping Number Conjecture for large classes of annular links, including alternating annular links and tangle closures exhibiting plumbed link phenomena. We do so by characterizing when a resolution is sufficient…

Building further on work of Marin and Wagner, we give a cubic braid-type skein theory of the Links--Gould polynomial invariant of oriented links and prove that it can be used to evaluate any oriented link, adding this polynomial to the list…

Continuing the quest for exclusive Racah matrices, which are needed for evaluation of colored arborescent-knot polynomials in Chern-Simons theory, we suggest to extract them from a new kind of a double-evolution -- that of the antiparallel…

We construct an algorithm to decide whether two given Legendrian or transverse links are equivalent. In general, the complexity of the algorithm is too high for practical implementation. However, in many cases, when the symmetry group of…

A very simple expression is conjectured for arbitrary colored Jones and HOMFLY polynomials of a rich $(g+1)$-parametric family of Pretzel knots and links. The answer for the Jones and HOMFLY polynomials is fully and explicitly expressed…

We show that for every m in N, there exists an n in N such that every embedding of the complete graph K_n in R^3 contains a link of two components whose linking number is at least m. Furthermore, there exists an r in N such that every…

We exhibit products of Mandelbrot sets in the two-dimensional complex parameter space of cubic polynomials. These products were observed by J. Milnor in computer experiments which inspired Lavaurs' proof of non local-connectivity for the…

The cosmetic crossing conjecture posits that switching a non-trivial crossing in a knot diagram always changes the knot type. Generalizing work of Balm, Friedl, Kalfagianni and Powell, and of Lidman and Moore, we give an Alexander…

We construct and describe the basic properties of a family of semifields in characteristic $2.$ The construction relies on the properties of projective polynomials over finite fields. We start by associating non-associative products to each…

In this paper we describe what should perhaps be called a `type-2' Vassiliev invariant of knots S^2 -> S^4. We give a formula for an invariant of 2-knots, taking values in Z_2 that can be computed in terms of the double-point diagram of the…

A graph is rectilinear planar if it admits a planar orthogonal drawing without bends. While testing rectilinear planarity is NP-hard in general (Garg and Tamassia, 2001), it is a long-standing open problem to establish a tight upper bound…

A classical problem, that goes back to the 1960's, is to characterize the integral domains R satisfying the property (IDn): "every singular nxn matrix over R is a product of idempotent matrices". Significant results, which describe this…

We describe a family of polynomials discovered via a particular recursion relation, which have connections to Chebyshev polynomials of the first and the second kind, and the polynomial version of Pell's equation. Many of their properties…

Given a knot K we may construct a group G_n(K) from the fundamental group of K by adjoining an nth root of the meridian that commutes with the corresponding longitude. These "generalised knot groups" were introduced independently by Wada…

In 2012, Cohen, Dasbach, and Russell presented an algorithm to construct a weighted adjacency matrix for a given knot diagram. In the case of pretzel knots, it is shown that after evaluation, the determinant of the matrix recovers the Jones…