期刊
FOUNDATIONS OF COMPUTATIONAL MATHEMATICS
卷 6, 期 4, 页码 387-426出版社
SPRINGER
DOI: 10.1007/s10208-003-0111-0
关键词
free Lie algebra; continous BCH function; rooted tree; Hopf algbra of rooted trees; Hall rooted trees; Lie series; dual PBW basis; rewritting algorithm; logarithm of Chenn-Fliess series; series of vector fields
We present an approach that allows performing computations related to the Baker-Campbell-Haussdorff (BCH) formula and its generalizations in an arbitrary Hall basis, using labeled rooted trees. In particular, we provide explicit formulas (given in terms of the structure of certain labeled rooted trees) of the continuous BCH formula. We develop a rewriting algorithm (based on labeled rooted trees) in the dual Poincare-Birkhoff-Witt (PBW) basis associated to an arbitrary Hall set, that allows handling Lie series, exponentials of Lie series, and related series written in the PBW basis. At the end of the paper we show that our approach is actually based on an explicit description of an epimorphism upsilon of Hopf algebras from the commutative Hopf algebra of labeled rooted trees to the shuffle Hopf algebra and its kernel ker upsilon.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据