WorksMathematics
The weight system at extends to a graph 4-invariant
Abstract · v2
A weight system is a function on chord diagrams that satisfies the four-term relations. The Lie algebra gives a weight system with values in the polynomial ring , and its value on a chord diagram depends only on the intersection graph of the diagram. Fomichev, Karev, Pavutnitskiy and Usanov showed that this weight system does not come from a function on graphs, and that a specialisation at a value can come from one only for , , or . The first three values were settled before. They conjectured that the last one, , which is the eigenvalue of the Casimir element on the oscillator representation, also extends. We prove this. The extension is the function , where is a graph with vertices and is a signed count of the maps that send each vertex of to a two-element subset of : a map counts with the sign for every edge whose two endpoints are sent to subsets meeting in exactly one element. The count is a polynomial in , so its value at makes sense. The four-term relation for is proved by an involution on these maps. The identity with the weight system is proved by letting the chord diagram act on Verma modules, then on the oscillator representation, where a supertrace on the Weyl algebra turns the value into a sum over perfect matchings, and finally by reading the same sum as a trace in a Clifford algebra on generators.
Review conversation
Reviews are not available for this work yet.