An algorithm for computing the Seifert matrix of a link from a braid representation
نویسنده
چکیده
A Seifert surface of a knot or link in S is an oriented surface in S whose boundary coincides with that of the link. A corresponding Seifert matrix has as its entries the linking numbers of a set of homology generators of the surface. Thus a Seifert matrix encodes essential information about the structure of a link and, unsurprisingly, can be used to define powerful invariants, such as the Alexander polynomial. The program SeifertView has been designed to visualise Seifert surfaces given by braid representations, but it does not give the user any technical information about the knot or link. This article describes an algorithm which could work alongside SeifertView and compute a Seifert matrix from the same braids and surfaces. It also calculates the genus of the surface, the Alexander polynomial of the knot and the signature of the knot.
منابع مشابه
Computing the Matrix Geometric Mean of Two HPD Matrices: A Stable Iterative Method
A new iteration scheme for computing the sign of a matrix which has no pure imaginary eigenvalues is presented. Then, by applying a well-known identity in matrix functions theory, an algorithm for computing the geometric mean of two Hermitian positive definite matrices is constructed. Moreover, another efficient algorithm for this purpose is derived free from the computation of principal matrix...
متن کاملA New Model Representation for Road Mapping in Emerging Sciences: A Case Study on Roadmap of Quantum Computing
One of the solutions for organizations to succeed in highly competitive markets is to move toward emerging sciences. These areas provide many opportunities, but, if organizations do not meet requirements of emerging sciences, they may fail and eventually, may enter a crisis. In this matter, one of the important requirements is to develop suitable roadmaps in variety fields such as strategic, ca...
متن کاملTask Scheduling Algorithm Using Covariance Matrix Adaptation Evolution Strategy (CMA-ES) in Cloud Computing
The cloud computing is considered as a computational model which provides the uses requests with resources upon any demand and needs.The need for planning the scheduling of the user's jobs has emerged as an important challenge in the field of cloud computing. It is mainly due to several reasons, including ever-increasing advancements of information technology and an increase of applications and...
متن کاملThe Gassner Representation for String Links
The Gassner representation of the pure braid group to GLn(Z[Z ]) can be extended to give a representation of the concordance group of n-strand string links to GLn(F ), where F is the field of quotients of Z[Z ], F = Q(t1, · · · , tn); this was first observed by Le Dimet. Here we give a cohomological interpretation of this extension. Our first application is to prove that the representation is h...
متن کاملImage Classification via Sparse Representation and Subspace Alignment
Image representation is a crucial problem in image processing where there exist many low-level representations of image, i.e., SIFT, HOG and so on. But there is a missing link across low-level and high-level semantic representations. In fact, traditional machine learning approaches, e.g., non-negative matrix factorization, sparse representation and principle component analysis are employed to d...
متن کامل