Related papers: A simple algorithm to compute link polynomials def…
This paper is a self-contained development of an invariant of graphs embedded in three-dimensional Euclidean space using the Jones polynomial and skein theory. Some examples of the invariant are computed. An unlinked embedded graph is one…
The maximum length of the shortest path from a leaf to the root of a skein tree for knots and links gives a measure of the complexity of computing link polynomials by the skein relation (the Jones polynomial, the Alexander-Conway…
In this expositional essay, we introduce some elements of the study of groups by analysing the braid pattern on a knitted blanket. We determine that the blanket features pure braids with a minimal number of crossings. Moreover, we determine…
This paper considers fast algorithms for operations on linearized polynomials. We propose a new multiplication algorithm for skew polynomials (a generalization of linearized polynomials) which has sub-quadratic complexity in the polynomial…
We give an explicit formula for the HOMFLY polynomial of a rational link (in particular, a knot) in terms of a special continued fraction for the rational number that defines the given link.
We propose an algorithm that approximates a given matrix polynomial of degree $d$ by another skew-symmetric matrix polynomial of a specified rank and degree at most $d$. The algorithm is built on recent advances in the theory of generic…
In this paper, we construct mock Alexander polynomials for starred links and linkoids in surfaces. These polynomials are defined as specific sums over states of link or linkoid diagrams that satisfy $f=n$, where $f$ denotes the number of…
We give an algorithm for computing the Teichm\"uller polynomial for a certain class of fibered alternating links associated to trees. Furthermore, we exhibit a mutant pair of such links distinguished by the Teichm\"uller polynomial.
We associate at each link a connectivity space which describes its splittability properties. Then, the notion of order for finite connectivity spaces results in the definition of a new numerical invariant for links, their connectivity…
In this paper we use artificial neural networks to predict and help compute the values of certain knot invariants. In particular, we show that neural networks are able to predict when a knot is quasipositive with a high degree of accuracy.…
We give generators and relations for the planar algebras corresponding to $ADE$ subfactors. We also give a basis and an algorithm to express an arbitrary diagram as a linear combination of these basis diagrams.
This article is based on the lectures in the Winter Braids V (Pau, Feb. 2015). Main puposel of this is to explain how to compute twisted Alexander polynomials for non-experts.
We give a general fixed parameter tractable algorithm to compute quantum invariants of links presented by diagrams, whose complexity is singly exponential in the carving-width (or the tree-width) of the diagram. In particular, we get a…
We define a monoid structure on the set of $k$-equal arrangements and use this structure to define limits of braid arrangements. We compute the cohomology of the associated limits of rational models of the arrangements complex complements.…
We prove the existence of a polynomial invariant that satisfies the HOMFLY skein relation for links in a lens space. In the process we also develop a skein theory of toroidal grid diagrams in a lens space.
A differential geometric characterization of the braid-index of a link is found. After multiplication by 2pi, it equals the infimum of the sum of total curvature and total absolute torsion over holonomic representatives of the link. Upper…
In the present paper we compute Alexander polynomials for certain classes of conic-line arrangements in the complex projective plane which are related to pencils. We prove two general results for curve arrangements coming from Halphen…
In statistical relational learning, the link prediction problem is key to automatically understand the structure of large knowledge bases. As in previous studies, we propose to solve this problem through latent factorization. However, here…
It is well known that the Blanchfield pairing of a knot can be expressed using Seifert matrices. In this paper, we compute the Blanchfield pairing of a colored link with non-zero Alexander polynomial. More precisely, we show that the…
A classical result states that the determinant of an alternating link is equal to the number of spanning trees in a checkerboard graph of an alternating connected projection of the link. We generalize this result to show that the…