Intersection Graphs for String Links
classification
🧮 math.GT
keywords
intersectionlinksstringsystemsweightgraphsadjacencyconway
read the original abstract
We extend the notion of intersection graphs for knots in the theory of finite type invariants to string links. We use our definition to develop weight systems for string links via the adjacency matrix of the intersection graph, and show that these weight systems are related to the weight systems induced by the Conway and Homfly polynomials.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.