Combinatorics of Hall trees and Hall words (Q1185905)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Combinatorics of Hall trees and Hall words |
scientific article; zbMATH DE number 35953
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Combinatorics of Hall trees and Hall words |
scientific article; zbMATH DE number 35953 |
Statements
Combinatorics of Hall trees and Hall words (English)
0 references
28 June 1992
0 references
Hall bases are bases of the free Lie algebra, that can be constructed via special trees and words that are called Hall trees resp. Hall words. The author gives new combinatorial proofs of the unique factorisation of words in Hall words using a rewriting system and its properties. On the other hand it is shown that properties of so-called Lyndon words generalize to Hall words if an adequate order on the free monoid is considered.
0 references
Hall trees
0 references
Hall words
0 references
free Lie algebra
0 references
unique factorisation
0 references
rewriting system
0 references
Lyndon words
0 references
free monoid
0 references
