binary delta-matroids modulo the 4-term relations so that the mapping taking a chord diagram to its delta-matroid extends to a morphism of Hopf algebras. One can hope that studying this Hopf algebra will allow one to clarify the structure of the Hopf algebra of weight systems, in particular, to find reasonable new estimates for the dimensions of the spaces of weight systems of given degree. Also it would be interesting to find a relationship between the Hopf algebras arising in this paper with a very close to them in spirit bialgebra of Lagrangian subspaces in [11].The authors are grateful to participants of the seminar "Combinatorics of Vassiliev invariants" at the Department of mathematics, Higher School of Economics and Sergei Chmutov for useful discussions.A set system (E; Φ) is a finite set E together with a subset Φ of the set 2 E of subsets in E. The set E is called the ground set of the set system, and elements of Φ are its feasible sets. Two set systems (E 1 ; Φ 1 ), (E 2 ; Φ 2 ) are said to be isomorphic if there is a one-to-one map E 1 → E 2 identifying the subset Φ 1 ⊂ 2 E 1 with the subset Φ 2 ⊂ 2 E 2 . Below, we make no difference between isomorphic set systems.A set system (E; Φ) is proper if Φ is nonempty. Below, we consider only proper set systems, without indicating this explicitly.

No abstract

No abstract

Finite order invariants (Vassiliev invariants) of knots are expressed in terms of weight systems, that is, functions on chord diagrams satisfying the four-term relations. Weight systems have graph analogues, so-called 4-invariants of graphs, i.e. functions on graphs that satisfy the four-term relations for graphs. Each 4-invariant determines a weight system.The notion of weight system is naturally generalized for the case of embedded graphs with an arbitrary number of vertices. Such embedded graphs correspond to links; to each component of a link there corresponds a vertex of an embedded graph. Recently, two approaches have been suggested to extend the notion of 4-invariants of graphs to the case of combinatorial structures corresponding to embedded graphs with an arbitrary number of vertices. The first approach is due to V. Kleptsyn and E. Smirnov, who considered functions on Lagrangian subspaces in a 2n-dimensional space over F 2 endowed with a standard symplectic form and introduced four-term relations for them. On the other hand, the second approach, the one due to Zhukov and Lando, suggests four-term relations for functions on binary delta-matroids. In this paper, we prove that the two approaches are equivalent.Finite order invariants (Vassiliev invariants) of knots are expressed in terms of weight systems, that is, functions on chord diagrams satisfying four-term relations. The vector space over C spanned by chord diagrams considered modulo four-term relations is supplied with a Hopf algebra structure. The notion of weight system is naturally extended from functions on * The article was prepared within the framework of the Academic

No abstract