On enumeration problems in Lie-Butcher theory
H. Munthe-Kaas and S. Krogstad
To appear in Special Issue of FCGS
Abstract:
The algebraic structure underlying non-commutative
Lie-Butcher series is the free Lie algebra over ordered trees. In this paper we present a characterization of this algebra in terms
of balanced Lyndon words over a binary alphabet. This yields a systematic manner of enumerating terms in non-commutative
Lie-Butcher series.
Submitted by stein@ii.uib.no Tue, 9
Oct 2002
Email of author:
hans@ii.uib.no
steinr@ii.uib.no
URL of author:
http://www.ii.uib.no/~hans/
Download:
2002-010