Values of the $\mathfrak{sl}_2$ weight system on complete bipartite graphs
P.Filippova

TL;DR
This paper derives explicit formulas for the $rak{sl}_2$ weight system on chord diagrams with intersection graphs that are complete bipartite graphs with limited size, using recurrence relations and algebraic projections.
Contribution
It provides new computational formulas for the $rak{sl}_2$ weight system on specific chord diagrams and confirms conjectures about its values on primitive elements.
Findings
Formulas for $rak{sl}_2$ weight system on certain bipartite graphs
Verification of conjectures on weight system values for primitive elements
Development of recurrence relations for computational purposes
Abstract
A weight system is a function on chord diagrams that satisfies the so-called four-term relations. Vassiliev's theory of finite-order knot invariants describes these invariants in terms of weight systems. In particular, there is a weight system corresponding to the colored Jones polynomial. This weight system can be easily defined in terms of the Lie algebra , but this definition is too cumbersome from the computational point of view, so that the values of this weight system are known only for some limited classes of chord diagrams. In the present paper we give a formula for the values of the weight system for a class of chord diagrams whose intersection graphs are complete bipartite graphs with no more than three vertices in one of the parts. Our main computational tool is the Chmutov--Varchenko reccurence relation. Furthermore, complete bipartite…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
