Search arXivSearch

arXiv · 2411.01128

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

Abstract

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.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sergei Lando, Zhuoke Yang. 2024-11-02. Chromatic polynomial and the $\mathfrak{so}$ weight system. https://arxiv.org/abs/2411.01128

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO