Combinatorics of Hall trees and Hall words
From MaRDI portal
Publication:1185905
DOI10.1016/0097-3165(92)90070-BzbMath0761.05033MaRDI QIDQ1185905
Publication date: 28 June 1992
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
free Lie algebra; rewriting system; Lyndon words; free monoid; Hall words; unique factorisation; Hall trees
05C05: Trees
68P10: Searching and sorting
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
68Q42: Grammars and rewriting systems
06B25: Free lattices, projective lattices, word problems
Related Items
Unnamed Item, Counterterms in the context of the universal Hopf algebra of renormalization, Representations of spin quiver Hecke algebras for orthosymplectic Lie superalgebras, Representations of Khovanov-Lauda-Rouquier algebras and combinatorics of Lyndon words., New results on Nyldon words and Nyldon-like sets, Continuity in a pathwise sense with respect to the coefficients of solutions of stochastic differential equations, Viennot factorization of infinite words, Lyndon words, permutations and trees., Growth of structure constants of free Lie algebras relative to Hall bases, Nyldon words
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
