The tridendriform structure of a Magnus expansion
arXiv:1306.6439 · doi:10.3934/dcds.2014.34.1021
Abstract
The notion of trees plays an important role in Butcher's B-series. More recently, a refined understanding of algebraic and combinatorial structures underlying the Magnus expansion has emerged thanks to the use of rooted trees. We follow these ideas by further developing the observation that the logarithm of the solution of a lihear first-order finite-difference equation can be written in terms of the Magnus expansion taking place in a pre-Lie algebra. By using basic combinatorics on planar reduced trees we derive a closed formula for the Magnus expansion in the context of free tridendriform algebra. The tridendriform algebra structure on word quasi-symmetric functions permits us to derive a discrete analogue of the Mielnik-Plebanski-Strichartz formula for this logarithm.
arXiv commentTo appear in Discrete and Continuous Dynamical Systems series A (AIMS). Partly supported by Agence Nationale de la Recherche, projet CARMA ANR-12-BS01-0017, and Ministerio de Economıa y Competitividad.MTM2011-23050
References in corpus (6)
- The Magnus expansion and some of its applications
- Homology of generalized partition posets
- Nonabelian generalized Lax pairs, the classical Yang-Baxter equation and PostLie algebras
- A Magnus- and Fer-type formula in dendriform algebras
- Dendriform Equations
- Twisted dendriform algebras and the pre-Lie Magnus expansion