Weight systems and invariants of graphs and embedded graphs

From MaRDI portal
Publication:6178263

DOI10.4213/RM10054EzbMATH Open1520.05048arXiv2302.12153OpenAlexW4381306139MaRDI QIDQ6178263FDOQ6178263


Authors: M. È. Kazaryan, S. Lando Edit this on Wikidata


Publication date: 1 September 2023

Published in: Russian Mathematical Surveys (Search for Journal in Brave)

Abstract: We describe recent achievements in the theory of weight systems, which are functions on chord diagrams satisfying so-called 4-term relations. Our main attention is devoted to constructions of weight systems. The two main sources of these constructions that are discussed in the paper are invariants of intersection graphs of chord diagrams that satisfy 4-term relations for graphs and metrized Lie algebras. For the simplest nontrivial metrized Lie algebra mathfraksl(2), we present recent results about the explicit form of generating functions for the values of the corresponding weight system on important families of chord diagrams. We also explain another recent result: construction of recurrence relations for computing the values of the mathfrakgl(N)-weight system. These relations are based on M. Kazarian's extension of the mathfrakgl(N)-weight system to arbitrary permutations. Certain recent papers suggest an approach to extending weight systems and graph invariants to arbitrary embedded graphs, which is based on the study of the corresponding Hopf algebra structures; we describe this approach. Weight systems defined on arbitrary embedded graphs correspond to finite type invariants of links (multicomponent knots).


Full work available at URL: https://arxiv.org/abs/2302.12153




Recommendations





Cited In (12)





This page was built for publication: Weight systems and invariants of graphs and embedded graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6178263)