Transition polynomial as a weight system for binary delta-matroids
From MaRDI portal
Abstract: To a singular knot K with n double points, one can associate a chord diagram with n chords. A chord diagram can also be understood as a 4-regular graph endowed with an oriented Euler circuit. L. Traldi introduced a polynomial invariant for such graphs, called a transition polynomial. We specialize this polynomial to a multiplicative weight system, that is, a function on chord diagrams satisfying 4-term relations and determining thus a finite type knot invariant. We prove a similar statement for the transition polynomial of general ribbon graphs and binary delta-matroids defined by R. Brijder and H. J. Hoogeboom, which defines, as a consequence, a finite type invariant of links.
Recommendations
Cites work
- Chords in a circle and linear algebra over GF(2)
- Delta-matroids and Vassiliev invariants
- Generalized duality for graphs on surfaces and the signed Bollobás-Riordan polynomial
- Graphs on surfaces and their applications. Appendix by Don B. Zagier
- Handle slides for delta-matroids
- scientific article; zbMATH DE number 4214039 (Why is no real title available?)
- Interlace polynomials for multimatroids and delta-matroids
- Maps and -matroids
- Matroids, delta-matroids and embedded graphs
- THE INTERSECTION GRAPH CONJECTURE FOR LOOP DIAGRAMS
- The transition matroid of a 4-regular graph: an introduction
- VASSILIEV KNOT INVARIANTS COMING FROM LIE ALGEBRAS AND 4-INVARIANTS
Cited in
(6)
This page was built for publication: Transition polynomial as a weight system for binary delta-matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5086236)