Free Lie superalgebras, trees and chains of partitions (Q1815595): Difference between revisions

The article is the extended and corrected version of ``Une présentation combinatoire de la super-algèbre de Lie'' [C. R. Acad. Sci., Paris, Sér. I 1215-1220 (1992; Zbl 0762.17003)]. It contains several combinatorial constructions giving different interpretations of the free Lie superalgebra. The constructions start from some basic set \(M,\) with a naturally defined multiplication and equivalence relations on linear combinations and lead to the naturally constructed free Lie superalgebras. As \(M\) are used: planar rooted binary and complete trees, with leaves labelled in the alphabet \(X;\) spatial rooted, binary and complete trees, with leaves labelled in \(X\) and nodes distinctly labelled increasing from leaves to the roots; spatial trees, with vertices labelled in \(X\) and edges having distinct labels.