# Delta-matroids and Vassiliev invariants

@article{Lando2016DeltamatroidsAV,
title={Delta-matroids and Vassiliev invariants},
author={Sergey Lando and V. Zhukov},
journal={arXiv: Combinatorics},
year={2016}
}
• Published 29 January 2016
• Mathematics
• arXiv: Combinatorics
Vassiliev (finite type) invariants of knots can be described in terms of weight systems. These are functions on chord diagrams satisfying so-called 4-term relations. In the study of the sl2 weight system, it was shown that its value on a chord diagram depends on the intersection graph of the diagram rather than on the diagram itself. Moreover, it was shown that the value of this weight system on an intersection graph depends on the cy- cle matroid of the graph rather than on the graph itself… Expand
Lagrangian Subspaces, Delta-Matroids, and Four-Term Relations
Finite-order invariants (Vassiliev invariants) of knots are expressed in terms of weight systems, that is, functions on chord diagrams (embedded graphs with a single vertex) satisfying the four-termExpand
Invariants of Framed Graphs and the Kadomtsev—Petviashvili Hierarchy
S. V. Chmutov, M. E. Kazarian, and S. K. Lando have recently introduced a class of graph invariants, which they called shadow invariants (these invariants are graded homomorphisms from the HopfExpand
Values of the $$\mathfrak{sl}_2$$ Weight System on Complete Bipartite Graphs
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 weightExpand
Transition polynomial as a weight system for binary delta-matroids
• Mathematics
• 2019
To a singular knot K with n double points, one can associate a chord diagram with n chords. A chord diagram can also be understood as a 4-regular graph endowed with an oriented Euler circuit. For aExpand
An extension of Stanley's chromatic symmetric function to binary delta-matroids
• Computer Science, Mathematics
• Discret. Math.
• 2021
This work considers the binary delta-matroid associated to an embedded graph and defines the extended Stanley's chromatic polynomial as an invariant ofDelta-matroids, which satisfies 4-term relations for simple graphs and determines in this way a knot invariant. Expand
Ribbon graphs and bialgebra of Lagrangian subspaces
• Mathematics
• 2015
To each ribbon graph we assign a so-called L-space, which is a Lagrangian subspace in an even-dimensional vector space with the standard symplectic form. This invariant generalizes the notion of theExpand
The interlace polynomial of binary delta-matroids and link invariants
In this work, we study the interlace polynomial as a generalization of a graph invariant to delta-matroids. We prove that the interlace polynomial satisfies the four-term relation for delta-matroidsExpand
An action of the Coxeter group $BC_n$ on maps on surfaces, Lagrangian matroids and their representations
For a map $\mathcal M$ cellularly embedded on a connected and closed orientable surface, the bases of its Lagrangian (also known as delta-) matroid $\Delta(\mathcal M)$ correspond to the bases of aExpand
Values of the $\mathfrak{sl}_2$ weight system on complete bipartite graphs
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 weightExpand