arXiv Analytics

Sign in

arXiv:2411.01128 [math.CO]AbstractReferencesReviewsResources

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

Sergei Lando, Zhuoke Yang

Published 2024-11-02Version 1

In a recent paper by M.Kazarian and the second author, a recurrence for the Lie algebras $\mathfrak{so}(N)$ weight systems has been suggested; the recurrence allows one to construct the universal $\mathfrak{so}$ weight system. The construction is based on an extension of the $\mathfrak{so}$ weight systems to permutations. Another recent paper, by M. Kazarian, N. Kodaneva, and the first author, shows that under the substitution $C_m=xN^{m-1}, m=1,2,\dots,$ for the Casimir elements $C_m$, the leading term in $N$ of the value of the universal $\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 $\mathfrak{so}$ weight system. That is, we show that the leading term of the universal $\mathfrak{so}$ weight system also becomes the chromatic polynomial under a specific substitution.

Related articles: Most relevant | Search more
arXiv:2505.04366 [math.CO] (Published 2025-05-07)
Improved bounds on the zeros of the chromatic polynomial of graphs and claw-free graphs
arXiv:1611.09545 [math.CO] (Published 2016-11-29)
New Bounds for Chromatic Polynomials and Chromatic Roots
arXiv:1209.5185 [math.CO] (Published 2012-09-24, updated 2015-09-02)
Bounds on Characteristic Polynomials