Combinatorics of Hall trees and Hall words (Q1185905): Difference between revisions

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.