INTERSECTION GRAPHS FOR STRING LINKS
From MaRDI portal
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.
Recommendations
Cites work
- A few weight systems arising from intersection graphs
- Bracket models for weight systems and the universal Vassiliev invariants
- Circle graph obstructions
- DISTINGUISHING MUTANTS BY KNOT POLYNOMIALS
- Finite-type invariants of knots, links, and graphs
- Knot polynomials and Vassiliev's invariants
- On a Hopf algebra in graph theory
- On the Melvin-Morton-Rozansky conjecture
- On the Vassiliev knot invariants
- THE INTERSECTION GRAPH CONJECTURE FOR LOOP DIAGRAMS
- The Kontsevich integral
Cited in
(7)- A few weight systems arising from intersection graphs
- String links with the same closure and group diagrams
- Mutant knots and intersection graphs
- TREE DIAGRAMS FOR STRING LINKS
- WEIGHT SYSTEMS FOR MILNOR INVARIANTS
- TREE DIAGRAMS FOR STRING LINKS II: DETERMINING CHORD DIAGRAMS
- CHORD DIAGRAMS AND COXETER LINKS
This page was built for publication: INTERSECTION GRAPHS FOR STRING LINKS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3379422)