Search arXivSearch

arXiv · 2505.24491

Generalized chord diagrams and weight systems

Abstract

Weight systems are functions on chord diagrams satisfying Vassiliev's $4$-term relations. They originate in the theory of finite type knot invariants. Recent developments in understanding weight systems arising from Lie algebras are based on extending these weight systems from chord diagrams (which can be interpreted as involutions without fixed points, considered modulo cyclic shifts) to arbitrary permutations (also modulo cyclic shifts). We suggest relations for functions on permutations, which generalize Vassiliev's relations. We show that the $gl$- and $so$- weight systems satisfy these relations. We also analyze certain properties of these weight systems and study realted Hopf algebras of permutations.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

M. Kazarian, E. Krasilnikov, S. Lando, M. Shapiro. 2025-05-30. Generalized chord diagrams and weight systems. https://arxiv.org/abs/2505.24491

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