English

Old and new powerful tools for the normal ordering problem and noncommutative binomials

Combinatorics 2024-10-14 v3 Quantum Algebra

Abstract

In this paper, we derive formal general formulas for noncommutative exponentiation and the exponential function, while also revisiting an unrecognized, and yet powerful theorem. These tools are subsequently applied to derive counterparts for the exponential identity eA+B=eAeBe^{A+B} = e^A e^B and the binomial theorem (A+B)n=(nk)AkBnk(A+B)^n = \sum \binom{n}{k} A^k B^{n-k} when the commutator [B,A][B, A] is either an arbitrary quadratic polynomial or a monomial in AA or BB. Analogous formulas are found when the commutator is bivariate. Furthermore, we introduce a novel operator bridging between the normal and antinormal ordered forms.

Keywords

Cite

@article{arxiv.2405.03001,
  title  = {Old and new powerful tools for the normal ordering problem and noncommutative binomials},
  author = {Kei Beauduin},
  journal= {arXiv preprint arXiv:2405.03001},
  year   = {2024}
}

Comments

21 pages, 0 figures, published in ECA

R2 v1 2026-06-28T16:17:17.931Z