Related papers: A simple algorithm to compute link polynomials def…
A string link S can be closed in a canonical way to produce an ordinary closed link L. We also consider a twisted closing which produces a knot K. We give a formula for the Conway polynomial of L as a product of the Conway polynomial of K…
In this paper, a method is given to calculate the Jones polynomial of the 6-plat presentations of knots by using a representation of the braid group $\mathbb{B}_6$ into a group of $5\times 5$ matrices. We also can calculate the Jones…
A previously proposed two-step algorithm for calculating the expectation values of Chern-Simons graphs fails to determine certain crucial signs. The step which involves calculating tetrahedra by solving certain non- linear equations is…
We show how polynomial path orders can be employed efficiently in conjunction with weak innermost dependency pairs to automatically certify polynomial runtime complexity of term rewrite systems and the polytime computability of the…
Evaluating a polynomial on a set of points is a fundamental task in computer algebra. In this work, we revisit a particular variant called trimmed multipoint evaluation: given an $n$-variate polynomial with bounded individual degree $d$ and…
Pulling back the weight system associated with the spinor representation of the Lie algebra so(7) by the universal Vassiliev-Kontsevich invariant yields a numerical link invariant with values in formal power series. Computing some skein…
We review a braid theoretic self-linking number formula and study its applications.
As a fundamental problem in many different fields, link prediction aims to estimate the likelihood of an existing link between two nodes based on the observed information. Since this problem is related to many applications ranging from…
We show a spectral sequence for the rational Khovanov homology of an oriented link in terms of the rational Khovanov complexes and homologies of the link surgeries along an admissible cut. As a non trivial corollary, we give an explicit…
We present a new algorithm by which the Adomian polynomials can be determined for scalar-valued nonlinear polynomial functional in a Hilbert space. This algorithm calculates the Adomian polynomials without the complicated operations such as…
The main result of the paper is the first polynomial-time algorithm for ranking bracelets. The time-complexity of the algorithm is O(k^2 n^4), where k is the size of the alphabet and n is the length of the considered bracelets. The key part…
In this paper we present a sequence of link invariants, defined from twisted Alexander polynomials, and discuss their effectiveness in distinguish knots. In particular, we recast and extend by geometric means a recent result of Silver and…
We give an explicit formula of the Alexander polynomial of the link obtained by adding an arbitrary number of full twists to positively oriented parallel n-strands in terms of the Alexander polynomials of the links obtained by adding…
We construct a family of root-finding algorithms which exploit the branched covering structure of a polynomial of degree $d$ with a path-lifting algorithm for finding individual roots. In particular, the family includes an algorithm that…
In this paper we present two different ways for computing the Kauffman bracket skein module of $S^1\times S^2$, ${\rm KBSM}\left(S^1\times S^2\right)$, via braids. We first extend the universal Kauffman bracket type invariant $V$ for knots…
We give a general procedure that provides, given any particular pretzel link, a braid whose closure is the pretzel link. Moreover, we manage to give a specific braid word in terms of the entries of the pretzel link.
We present computational methods for constructing orthogonal/orthonormal polynomials over arbitrary polygonal domains in $\mathbb{R}^2$ using bivariate spline functions. Leveraging a mature MATLAB implementation which generates spline…
Mikhail Khovanov in math.QA/9908171 defined, for a diagram of an oriented classical link, a collection of groups numerated by pairs of integers. These groups were constructed as homology groups of certain chain complexes. The Euler…
In this paper we report on an application of computer algebra in which mathematical puzzles are generated of a type that had been widely used in mathematics contests by a large number of participants worldwide. The algorithmic aspect of our…
For all natural numbers $N$ and prime numbers $p$, we find a knot $K$ whose skein polynomial $P_K(a,z)$ evaluated at $z=N$ has trivial reduction modulo $p$. An interesting consequence of our construction is that all polynomials $P_K(a,N)$…