Related papers: A simple algorithm to compute link polynomials def…
It is well known how the linking number and framing can be extracted from the degree 1 part of the (framed) Kontsevich integral. This note gives a general formula expressing any product of powers of these two invariants as combination of…
We obtain a novel formula for characteristic polynomials of deformations of the Braid arrangement using the notion of levels of regions. As an application, we recover and strengthen results of Chen et al. on the characteristic polynomial of…
A method to obtain explicit and complete topological solution of SU(2) Chern-Simons theory on $S^3$ is developed. To this effect the necessary aspects of the theory of coloured-oriented braids and duality properties of conformal blocks for…
We find the minimal number of links in an embedding of any complete $k$-partite graph on 7 vertices (including $K_7$, which has at least 21 links). We give either exact values or upper and lower bounds for the minimal number of links for…
We compute the Schur indices in the presence of some line operators based on our con- jectural formula introduced in [1]. In particular, we focus on the rank 1 superconformal field theories with the enhanced global symmetry and the free…
Skew polynomials are a class of non-commutative polynomials that have several applications in computer science, coding theory and cryptography. In particular, skew polynomials can be used to construct and decode evaluation codes in several…
A braid-like isotopy for links in 3-space is an isotopy which uses only those Reidemeister moves which occur in isotopies of braids. We define a refined Jones polynomial and its corresponding Khovanov homology which are, in general, only…
In the 1920's Artin defined the braid group in an attempt to understand knots in a more algebraic setting. A braid is a certain arrangement of strings in three-dimensional space. It is a celebrated theorem of Alexander that every knot is…
We describe efficient algorithms to search for cases in which binomial coefficients are equal or almost equal, give a conjecturally complete list of all cases where two binomial coefficients differ by 1, and give some identities for…
We speed up existing decoding algorithms for three code classes in different metrics: interleaved Gabidulin codes in the rank metric, lifted interleaved Gabidulin codes in the subspace metric, and linearized Reed-Solomon codes in the…
Link prediction is a common problem in network science that transects many disciplines. The goal is to forecast the appearance of new links or to find links missing in the network. Typical methods for link prediction use the topology of the…
It is known that the writhe calculated from any reduced alternating link diagram of the same (alternating) link has the same value. That is, it is a link invariant if we restrict ourselves to reduced alternating link diagrams. This is due…
We find that Alexander polynomial of a ribbon knot in $ \mathbb{Z}HS^3 $ is determined by the intrinsic singularity information of its ribbon, and give a formula to calculate Alexander polynomial of a ribbon knot by that. We define half…
We present a new approach for inference in Bayesian networks, which is mainly based on partial differentiation. According to this approach, one compiles a Bayesian network into a multivariate polynomial and then computes the partial…
We design an algorithm writing down presentations of graph braid groups. Generators are represented in terms of actual motions of robots moving without collisions on a given graph. A key ingredient is a new motion planning algorithm whose…
Link prediction is one of the fundamental problems in network analysis. In many applications, notably in genetics, a partially observed network may not contain any negative examples of absent edges, which creates a difficulty for many…
We show how the Alexander polynomial of links in lens spaces is related to the classical Alexander polynomial of a link in the 3-sphere, obtained by cutting out the exceptional lens space fibre. It follows from these relationship that a…
We discuss the polynomial representation for long knots and elaborate on how to obtain them with a bound on degrees of the defining polynomials, for any knot-type.
In this paper we propose a novel efficient algorithm for calculating winding numbers, aiming at counting the number of roots of a given polynomial in a convex region on the complex plane. This algorithm can be used for counting and…
We use Polyak's skein relation to give a new proof that Milnor's string link homotopy invariants are finite type invariants, and to develop a recursive relation for their associated weight systems. We show that the obstruction to the…