A few weight systems arising from intersection graphs (Q1432726)

Any knot invariant taking values in an Abelian group can be extended to an invariant of singular knots (knots with double points) by replacing each double point with the difference between the corresponding positive crossing and the negative crossing. A finite type invariant (or Vassiliev invariant) of type \(n\) is an invariant that vanishes for all the singular knots with more than \(n\) double points. A chord diagram of degree \(n\) is an oriented circle with \(n\) chords whose endpoints are on the circle. Given a singular knot one can define a chord diagram by connecting pairs of points corresponding to all the double points. The vector space over \(\mathbb{C}\) of chord diagrams with \(n\) chords modulo the four-term relation corresponding to the third Reidemeister move is denoted by \(A_{n}\). The quotient of \(A_{n}\) modulo the one-term relation corresponding to the first Reidemeister move is denoted by \(\widehat{A}_{n}\). The dual space of \(\widehat{A}_{n}\) (\(A_{n}\), respectively) is denoted by \(\widehat{W}_{n}\) (\(W_{n}\), respectively) and an element of \(\widehat{A}_{n}\) (\(A_{n}\), respectively) is called a weight system (regular weight system, respectively) of degree \(n\). It is well-known that \(\widehat{W}_{n}\) is isomorphic to \(V_{n}/V_{n-1}\), where \(V_{n}\) is the vector space generated by finite type invariants of type \(n\) [\textit{M. Kontsevich}, Adv. Sov. Math. 16, 137--150 (1993; Zbl 0839.57006)]. Given a chord diagram, its intersection graph is defined as the simple graph consisting of vertices corresponding to the chords of \(D\) and edges connecting two vertices when the corresponding chords intersect. The vector space generated by simple graphs with \(n\) vertices modulo the four-term relation corresponding to that of chord diagrams is denoted by \(F_{n}\). We can also define \(\widehat{F}_{n}\) as the quotient of \(F_{n}\) by the one-term relation. An element in the dual space of \(\widehat{F}_{n}\) (\(F_{n}\), respectively) is called a graph weight system (regular graph weight system, respectively). Note that a (regular) graph weight system \(\gamma\) defines a (regular) weight system. In general the converse is not true, but for several cases graph weight systems define weight systems [\textit{S. V. Chmutov, S. V. Duzhin} and \textit{S. K. Lando}, Adv. Sov. Math. 21, 117--126 (1994; Zbl 0956.57009), ibid. 127--134 (1994; Zbl 0956.57010), ibid. 135--145 (1994; Zbl 0956.57011)]. In particular, the weight systems arising from the Conway, HOMFLYPT, and Kauffman polynomials are such cases. In the paper under review the author gives explicit formulas for these (regular) weight systems in terms of intersection graphs.