相关论文: Algorithm for finding boundary link Seifert matric…

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…

We generalize H. Seifert's algorithm for finding a Seifert surface for a knot or link. The generalization applies to "framed oriented measured lamination links." For knots, a Seifert surface determines a unique framing. In our setting, we…

We show some properties of a Seifert matrix of an $n$-component Brunnian link. In particular, we give a necessary and sufficient condition for a matrix to be a Seifert matrix of a 2-component Brunnian link up to S-equivalence.

Recently, Bigelow defined a diagrammatic method for calculating the Alexander polynomial of a knot or link by resolving crossings in a planar algebra. I will present my multivariate version of Bigelow's calculation. The advantage to my…

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 develop a diagrammatic calculus for representations of unrolled quantum $\mathfrak{sl}_2$ at a fourth root of unity. This allows us to prove Seifert-Torres type formulas for certain splice links using quantum algebraic methods, rather…

We explore the codimension one strata in the degree-one cohomology jumping loci of a finitely generated group, through the prism of the multivariable Alexander polynomial. As an application, we give new criteria that must be satisfied by…

We introduce a new algebraic topological technique to detect non-fibred knots in the three sphere using the twisted Alexander invariants. As an application, we show that for any Seifert matrix of a knot with a nontrivial Alexander…

We establish basic information about border rank algorithms for the matrix multiplication tensor and other tensors with symmetry. We prove that border rank algorithms for tensors with symmetry (such as matrix multiplication and the…

In this study, an algorithm for computing the inverse of periodic k banded matrices, which are needed for solving the differential equations by using the finite differences, the solution of partial differential equations and the solution of…

Border bases can be considered to be the natural extension of Gr\"obner bases that have several advantages. Unfortunately, to date the classical border basis algorithm relies on (degree-compatible) term orderings and implicitly on reduced…

This paper studies the saddle point problem of polynomials. We give an algorithm for computing saddle points. It is based on solving Lasserre's hierarchy of semidefinite relaxations. Under some genericity assumptions on defining…

The Goeritz matrix of a link is obtained from the Jacobian matrix of a modified Dehn presentation associated to a diagram using Fox's free differential calculus. When the diagram is special the Seifert matrix can also be determined from the…

Linear differential equations of arbitrary order with polynomial coefficients are considered. Specifically, necessary and sufficient conditions for the existence of polynomial solutions of a given degree are obtained for these equations. An…

The Border algorithm and the iPred algorithm find the Hasse diagrams of FCA lattices. We show that they can be generalized to arbitrary lattices. In the case of iPred, this requires the identification of a join-semilattice homomorphism into…

We construct an algorithm to decide whether two given Legendrian or transverse links are equivalent. In general, the complexity of the algorithm is too high for practical implementation. However, in many cases, when the symmetry group of…

We introduce an elementary method to study the border rank of polynomials and tensors, analogous to the apolarity lemma. This can be used to describe the border rank of all cases uniformly, including those very special ones that resisted a…

In recent years, twisted Alexander polynomial has been playing an important role in low-dimensional topology. For Montesinos links, we develop an efficient method to compute the twisted Alexander polynomial associated to any linear…

Eigenvectors of matrices on a network have been used for understanding spectral clustering and influence of a vertex. For matrices with small geodesic-width, we propose a distributed iterative algorithm in this letter to find eigenvectors…

We give an explicit algorithm for calculating the Kauffman bracket of a link diagram from a Goeritz matrix for that link. Further, we show how the Jones polynomial can be recovered from a Goeritz matrix when the corresponding checkerboard…