English

On Lie algebra weight systems for 3-graphs

Quantum Algebra 2014-12-23 v1 Combinatorics Representation Theory

Abstract

A {\em 33-graph} is a connected cubic graph such that each vertex is is equipped with a cyclic order of the edges incident with it. A {\em weight system} is a function ff on the collection of 33-graphs which is {\em antisymmetric}: f(H)=f(G)f(H)=-f(G) if HH arises from GG by reversing the orientation at one of its vertices, and satisfies the IHX-equation. Key instances of weight systems are the functions φg\varphi_{\frak{g}} obtained from a metric Lie algebra g\frak{g} by taking the structure tensor cc of g\frak{g} with respect to some orthonormal basis, decorating each vertex of the 33-graph by cc, and contracting along the edges. We give equations on values of any complex-valued weight system that characterize it as complex Lie algebra weight system. It also follows that if f=φgf=\varphi_{\frak{g}} for some complex metric Lie algebra g\frak{g}, then f=φgf=\varphi_{\frak{g}'} for some unique complex reductive metric Lie algebra g\frak{g}'. Basic tool throughout is geometric invariant theory.

Keywords

Cite

@article{arxiv.1412.6923,
  title  = {On Lie algebra weight systems for 3-graphs},
  author = {Alexander Schrijver},
  journal= {arXiv preprint arXiv:1412.6923},
  year   = {2014}
}
R2 v1 2026-06-22T07:40:24.528Z