English

Chromatic polynomial and the $\mathfrak{so}$ weight system

Combinatorics 2024-11-05 v1

Abstract

In a recent paper by M.Kazarian and the second author, a recurrence for the Lie algebras so(N)\mathfrak{so}(N) weight systems has been suggested; the recurrence allows one to construct the universal so\mathfrak{so} weight system. The construction is based on an extension of the so\mathfrak{so} weight systems to permutations. Another recent paper, by M. Kazarian, N. Kodaneva, and the first author, shows that under the substitution Cm=xNm1,m=1,2,,C_m=xN^{m-1}, m=1,2,\dots, for the Casimir elements CmC_m, the leading term in NN of the value of the universal gl\mathfrak{gl} weight system becomes the chromatic polynomial of the intersection graph of the chord diagram. In the present paper, we establish a similar result for the universal so\mathfrak{so} weight system. That is, we show that the leading term of the universal so\mathfrak{so} weight system also becomes the chromatic polynomial under a specific substitution.

Cite

@article{arxiv.2411.01128,
  title  = {Chromatic polynomial and the $\mathfrak{so}$ weight system},
  author = {Sergei Lando and Zhuoke Yang},
  journal= {arXiv preprint arXiv:2411.01128},
  year   = {2024}
}
R2 v1 2026-06-28T19:45:17.537Z