Papers › Combinatorics of boson normal ordering and some applications
Combinatorics of boson normal ordering and some applications
P. Blasiak
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We provide the solution to the normal ordering problem for powers and exponentials of two classes of operators. The first one consists of boson strings and more generally homogeneous polynomials, while the second one treats operators linear in one of the creation or annihilation operators. Both solutions generalize Bell and Stirling numbers arising in the number operator case. We use the advanced combinatorial analysis to provide closed form expressions, generating functions, recurrences, etc. The analysis is based on the Dobi\'nski-type relations and the umbral calculus methods. As an illustration of this framework we point out the applications to the construction of generalized coherent states, operator calculus and ordering of deformed bosons.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections