Dynkin’s method of computing the terms of the Baker–Campbell–Hausdorff series

DOI10.1063/1.528242zbMath0676.17004MaRDI QIDQ3831168

Asok K. Bose

Publication date: 1989

Published in: Journal of Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1063/1.528242

zbMATH Keywords

algorithm; rational coefficients; Baker-Campbell-Hausdorff theorem; infinite series of iterated commutators

Mathematics Subject Classification ID

17B05: Structure theory for Lie algebras and superalgebras

22E05: Local Lie groups

17-04: Software, source code, etc. for problems pertaining to nonassociative rings and algebras

Related Items

The Baker–Campbell–Hausdorff formula and nested commutator identities, The early proofs of the theorem of Campbell, Baker, Hausdorff, and Dynkin, An effective version of the Lazard correspondence., Quantum decoration transformation for spin models, Matrices and their (un)faithful Fermi-quadratic forms, Variations on a theme of Jost and Pais, A simple expression for the terms in the Baker–Campbell–Hausdorff series, From time-ordered products to Magnus expansion, A constructive algorithm for the Cartan decomposition of SU(2N), An efficient algorithm for computing the Baker–Campbell–Hausdorff series and some of its applications

Cites Work

• The formal power series for \(\log\,e^x e^y\)
• An elementary proof of the Baker-Campbell-Hausdorff-Dynkin formula
• The Baker-Hausdorff Formula and a Problem in Crystal Physics
• Expansion of the Campbell‐Baker‐Hausdorff formula by computer
• On the exponential solution of differential equations for a linear operator