Lyndon bases of free partially commutative Lie algebras (Q688702): Difference between revisions

The author showed previously [Discrete Math. 33, 271-280 (1981; Zbl 0458.68025)] that Lyndon heaps from a combinatorial analogue of Lyndon words in the free partially commutative monoid. The analogy is pushed forward: using a suitably defined standard bracketing, the set of Lyndon heaps is transformed into a basis of the corresponding free partially commutative Lie algebra, generalizing a well known property of Lyndon words. Lothaire's algorithm -- expressing the bracket of two basis elements in terms of the basis in the non-commutative case [see chapter 5 in \textit{M. Lothaire}, Combinatorics on words, Addison Wesley (1983; Zbl 0514.20045)] -- is extended to take into account the partial commutations.