Related papers: Polynomial algorithm for alternating link equivale…
This article provides an overview of relative strengths of polynomial invariants of knots and links, such as the Alexander, Jones, Homflypt, Kaufman two-variable polynomial, and Khovanov polynomial.
We give sharp two-sided linear bounds of the crosscap number (non-orientable genus) of alternating links in terms of their Jones polynomial. Our estimates are often exact and we use them to calculate the crosscap numbers for several…
In his 1957 paper, John Milnor introduced a collection of invariants for links in $S^3$ detecting higher-order linking phenomena by studying lower central quotients of link groups and comparing them to those of the unlink. These invariants,…
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…
We introduce a novel model of multipartite entanglement based on topological links, generalizing the graph/hypergraph entropy cone program. We demonstrate that there exist link representations of entropy vectors which provably cannot be…
Increasing the connectivity of a graph is a pivotal challenge in robust network design. The weighted connectivity augmentation problem is a common version of the problem that takes link costs into consideration. The problem is then to find…
We study the problem of enumerating Tarski fixed points on finite lattices. We derive query complexity lower bounds for finding three or more Tarski fixed points of isotone maps and the subclasses of increasing and decreasing isotone maps.…
Knotoids are open ended knot diagrams regarded up to Reidemeister moves and isotopies. The notion is introduced by V.~Turaev in 2012. Two most important numeric characteristics of a knotoid are the crossing number and the height. The latter…
We prove that certain problems naturally arising in knot theory are NP--hard or NP--complete. These are the problems of obtaining one diagram from another one of a link in a bounded number of Reidemeister moves, determining whether a link…
J. Davis showed that the topological concordance class of a link in the 3-sphere is uniquely determined by its Alexander polynomial for 2-component links with Alexander polynomial one. A similar result for knots with Alexander polynomial…
In this paper we study the theory of knotoids and braidoids and the theory of pseudo knotoids and pseudo braidoids on the torus T. In particular, we introduce the notion of {\it mixed knotoids} in $S^2$, that generalize the notion of mixed…
In this paper we study the topology of three different kinds of spaces associated to polynomial knots of degree at most $d$, for $d\geq2$. We denote these spaces by $\mathcal{O}_d$, $\mathcal{P}_d$ and $\mathcal{Q}_d$. For $d\geq3$, we show…
We describe a method of encoding various types of link diagrams, including those with classical, flat, rigid, welded, and virtual crossings. We show that this method may be used to encode link diagrams, up to equivalence, in a notation…
Although most knots are nonalternating, modern research in knot theory seems to focus on alternating knots. We consider here nonalternating knots and their properties. Specifically, we show certain classes of knots have nontrivial Jones…
One of the purposes in this paper is to provide a better understanding of the alternance property which occurs in Chebyshev polynomial approximation and piecewise polynomial approximation problems. In the first part of this paper, we…
It has been conjectured that the algebraic crossing number of a link is uniquely determined in minimal braid representation. This conjecture is true for many classes of knots and links. The Morton-Franks-Williams inequality gives a lower…
Link prediction methods use patterns in known network data to infer which connections may be missing. Previous work has shown that continuous-time quantum walks can be used to represent path-based link prediction, which we further study…
A polynomial knot in $\mathbb{R}^n$ is a smooth embedding of $\mathbb{R}$ in $\mathbb{R}^n$ such that the component functions are real polynomials. In the earlier paper with Mishra, we have studied the space $\mathcal{P}$ of polynomial…
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 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…