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

DOI10.1063/1.528242zbMath0676.17004OpenAlexW2036121881MaRDI 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

algorithmrational coefficientsBaker-Campbell-Hausdorff theoreminfinite series of iterated commutators

Mathematics Subject Classification ID

Structure theory for Lie algebras and superalgebras (17B05) Local Lie groups (22E05) Software, source code, etc. for problems pertaining to nonassociative rings and algebras (17-04)

Related Items

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

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