Monomiality principle, Sheffer-type polynomials and the normal ordering problem

K.A. Penson, P. Blasiak, G. Dattoli, G.H.E. Duchamp, A. Horzela, A.I. Solomon

Research output: Contribution to conferencePaper

6 Citations (Scopus)


We solve the boson normal ordering problem for (q(a†)a + v(a†))nwith arbitrary functions q(x) and v(x) and integer n, where a and a† are boson annihilation and creation operators, satisfying [a, a†] = 1. This consequently provides the solution for the exponential eλ(q(a†)a + v(a†))generalizing the shift operator. In the course of these considerations we define and explore the monomiality principle and find its representations. We exploit the properties of Sheffer-type polynomials which constitute the inherent structure of this problem. In the end we give some examples illustrating the utility of the method and point out the relation to combinatorial structures. © 2006 IOP Publishing Ltd.
Original languageEnglish
Publication statusPublished - 28 Feb 2006
Externally publishedYes


All Science Journal Classification (ASJC) codes

  • Physics and Astronomy(all)

Cite this

Penson, K. A., Blasiak, P., Dattoli, G., Duchamp, G. H. E., Horzela, A., & Solomon, A. I. (2006). Monomiality principle, Sheffer-type polynomials and the normal ordering problem.