Skip to main content
Log in

The Boson Normal Ordering Problem and Generalized Bell Numbers

  • Original Paper
  • Published:
Annals of Combinatorics Aims and scope Submit manuscript

Abstract

For any function F(x) having a Taylor expansion we solve the boson normal ordering problem for $F [(a^\dag)^r a^s]$, with r, s positive integers, $F [(a, a^\dag]=1$, i.e., we provide exact and explicit expressions for its normal form $\mathcal{N} \{F [(a^\dag)^r a^s]\} = F [(a^\dag)^r a^s]$, where in $ \mathcal{N} (F) $ all a's are to the right. The solution involves integer sequences of numbers which, for $ r, s \geq 1 $, are generalizations of the conventional Bell and Stirling numbers whose values they assume for $ r=s=1 $. A complete theory of such generalized combinatorial numbers is given including closed-form expressions (extended Dobinski-type formulas), recursion relations and generating functions. These last are special expectation values in boson coherent states.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to K. A. Penson.

Additional information

AMS Subject Classification: 81R05, 81R15, 81R30, 47N50.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Blasiak, P., Penson, K.A. & Solomon, A.I. The Boson Normal Ordering Problem and Generalized Bell Numbers. Ann. Combin. 7, 127–139 (2003). https://doi.org/10.1007/s00026-003-0177-z

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00026-003-0177-z

Navigation