Some useful combinatorial formulae for bosonic operators

Abstract

We give a general expression for the normally ordered form of a function F(w(a,a*)) where w is a function of boson annihilation and creation operators satisfying [a,a*]=1. The expectation value of this expression in a coherent state becomes an exact generating function of Feynman-type graphs associated with the zero-dimensional Quantum Field Theory defined by F(w). This enables one to enumerate explicitly the graphs of given order in the realm of combinatorially defined sequences. We give several examples of the use of this technique, including the applications to Kerr-type and superfluidity-type hamiltonians.

8 pages, 3 figures, 17 references

References in corpus (1)

• The general boson normal ordering problem

Cited by in corpus (11)

• Combinatorics of boson normal ordering and some applications
• Combinatorial approach to generalized Bell and Stirling numbers and boson normal ordering problem
• Laguerre-type derivatives: Dobinski relations and combinatorial identities
• Wick's theorem for q-deformed boson operators
• Noncrossing normal ordering for functions of boson operators
• Combinatorial Solutions to Normal Ordering of Bosons
• From Quantum Mechanics to Quantum Field Theory: The Hopf route
• Combinatorial interpretation and proof of Glaisher-Crofton identity
• Exponential Operators, Dobinski Relations and Summability
• Feynman graphs and related Hopf algebras
• A generic Hopf algebra for quantum statistical mechanics