Combinatorics of Hall trees and Hall words

DOI10.1016/0097-3165(92)90070-BzbMath0761.05033MaRDI QIDQ1185905

Guy Melançon

Publication date: 28 June 1992

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

zbMATH Keywords

free Lie algebrarewriting systemLyndon wordsfree monoidHall wordsunique factorisationHall trees

Mathematics Subject Classification ID

Trees (05C05) Searching and sorting (68P10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Grammars and rewriting systems (68Q42) Free lattices, projective lattices, word problems (06B25)

Related Items (12)

New results on Nyldon words and Nyldon-like sets ⋮ Representations of spin quiver Hecke algebras for orthosymplectic Lie superalgebras ⋮ Unnamed Item ⋮ Viennot factorization of infinite words ⋮ Representations of orientifold Khovanov-Lauda-Rouquier algebras and the Enomoto-Kashiwara algebra ⋮ Quantum loop groups and shuffle algebras via Lyndon words ⋮ Lyndon words, permutations and trees. ⋮ Counterterms in the context of the universal Hopf algebra of renormalization ⋮ Representations of Khovanov-Lauda-Rouquier algebras and combinatorics of Lyndon words. ⋮ Continuity in a pathwise sense with respect to the coefficients of solutions of stochastic differential equations ⋮ Nyldon words ⋮ Growth of structure constants of free Lie algebras relative to Hall bases

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Note on a basis of P. Hall for the higher commutators in free groups
• Factorizing words over an ordered alphabet
• Lyndon Words, Free Algebras and Shuffles
• A Contribution to the Theory of Groups of Prime-Power Order
• Basic commutators
• On a Factorisation of Free Monoids
• A Basis for Free Lie Rings and Higher Commutators in Free Groups
• On Burnside's Problem

This page was built for publication: Combinatorics of Hall trees and Hall words