Related papers: A simple algorithm to compute link polynomials def…
A new algebraic method for computing helicity is developed, by discovering a relationship between helicity of fluid mechanics and algebraic polynomial invariants of knot theory. We have constructed a topological invariant…
Rook polynomials are a powerful tool in the theory of restricted permutations. It is known that the rook polynomial of any board can be computed recursively, using a cell decomposition technique of Riordan. In this paper, we give a new…
An efficient numerical algorithm for the computation of linking number is presented. The algorithm keep tracks or rounding error so that it can ensure the correctness of the results.
It is required to find an optimal order of constructing the edges of a network so as to minimize the sum of the weighted connection times of relevant pairs of vertices. Construction can be performed anytime anywhere in the network, with a…
Complex braid groups are the natural generalizations of braid groups associated to arbitrary (finite) complex reflection groups. We investigate several methods for computing the homology of these groups. In particular, we get the Poincar\'e…
In this article, a new approach based on linear algebra is adopted to study a hybrid Sheffer polynomial sequences. The recurrence relations and differential equation for these polynomials are derived by using the properties and…
We describe an efficient algorithm to compute a pseudotriangulation of a finite planar family of pairwise disjoint convex bodies presented by its chirotope. The design of the algorithm relies on a deepening of the theory of visibility…
This paper describes a method for the automatic evaluation of the Links-Gould two-variable polynomial link invariant (LG) for any link, given only a braid presentation. This method is currently feasible for the evaluation of LG for links…
It is an open question to give a combinatorial interpretation of the Falk invariant of a hyperplane arrangement, i.e. the third rank of successive quotients in the lower central series of the fundamental group of the arrangement. In this…
We describe completely the link invariants constructed using Markov traces on the Yokonuma-Hecke algebras in terms of the linking matrix and the HOMFLYPT polynomials of sublinks.
In this paper, we describe an algorithm that efficiently collect relations in class groups of number fields defined by a small defining polynomial. This conditional improvement consists in testing directly the smoothness of principal ideals…
We introduce "book links" as a generalization of braids in open book decompositions; this new class of objects includes both braids and plats as special cases. We then prove a version of Markov's theorem in this general setting by extending…
This paper discusses a new method to solve definite integrals using artificial neural networks. The objective is to build a neural network that would be a novel alternative to pre-established numerical methods and with the help of a…
We use the divide-and-conquer and scanning algorithms for calculating Khovanov cohomology directly on the Lee- or Bar-Natan deformations of the Khovanov complex to give an alternative way to compute Rasmussen $s$-invariants of knots. By…
This work presents formulas for the Kauffman bracket and Jones polynomials of 3-bridge knots using the structure of Chebyshev knots and their billiard table diagrams. In particular, these give far fewer terms than in the Skein relation…
We construct a 2-variable link polynomial, called $W_L$, for classical links by considering simultaneously the Kauffman state models for the Alexander and for the Jones polynomials. We conjecture that this polynomial is the product of two…
We provide explicit formulas for the Alexander polynomial of pretzel knots and establish several immediate corollaries, including the characterization of pretzel knots with a trivial Alexander polynomial. As an application, we construct a…
We associate to each Boolean function a polynomial whose evaluations represents the distances from all possible Boolean affine functions. Both determining the coefficients of this polynomial from the truth table of the Boolean function and…
In this survey we summarize results regarding the Kauffman bracket, HOMFLYPT, Kauffman 2-variable and Dubrovnik skein modules, and the Alexander polynomial of links in lens spaces, which we represent as mixed link diagrams. These invariants…
We extend the algorithms of Robinson, Smyth, and McKee--Smyth to enumerate all real-rooted integer polynomials of a fixed degree, where the first few (at least three) leading coefficients are specified. Additionally, we introduce new linear…