On enumeration problems in LieButcher theory
The algebraic structure underlying non-commutative LieButcher 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 LieButcher series.
enumeration trees butcher theory lie group integrators rungekutta methods