Answers are grounded in this paper and cite their sources.
We discuss a general combinatorial framework for operator ordering problems by applying it to the normal ordering of the powers and exponential of the boson number operator. The solution of the problem is given in terms of Bell and Stirling numbers enumerating partitions of a set. This framework reveals several inherent relations between ordering problems and combinatorial objects, and displays the analytical background to Wick’s theorem. The methodology can be straightforwardly generalized from the simple example we discuss to a wide class of operators.
No takes yet. Share an insight, caveat, or question.
Błasiak et al. (2007) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: