The general boson normal ordering problem

  title={The general boson normal ordering problem},
  author={Pawel Blasiak and Karol A. Penson and VI AllanI.SolomonUniversityofParis and France. and Polish Academy of Sciences and Krak{\'o}w and Poland and The Open University and Milton Keynes and UK.},
  journal={Physics Letters A},
Abstract We solve the boson normal ordering problem for F[(a † ) r a s ] , with r , s positive integers, [a,a † ]=1 , i.e., we provide exact and explicit expressions for its normal form N {F[(a † ) r a s ]} , where in N (F) all a 's are to the right. The solution involves integer sequences of numbers which are generalizations of the conventional Bell and Stirling numbers whose values they assume for r = s =1. A comprehensive theory of such generalized combinatorial numbers is given including… Expand
Boson normal ordering via substitutions and Sheffer-type polynomials
Abstract We solve the boson normal ordering problem for ( q ( a † ) a + v ( a † ) ) n with arbitrary functions q and v and integer n , where a and a † are boson annihilation and creation operators,Expand
Combinatorial approach to generalized Bell and Stirling numbers and boson normal ordering problem
We consider the numbers arising in the problem of normal ordering of expressions in boson creation a† and annihilation a operators ([a,a†]=1). We treat a general form of a boson stringExpand
Some useful combinatorial formulas for bosonic operators
We give a general expression for the normally ordered form of a function F[w(a,a†)] where w is a function of boson creation and annihilation operators satisfying [a,a†]=1. The expectation value ofExpand
Combinatorics of boson normal ordering and some applications
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,Expand
Normal Order:. Combinatorial Graphs
A conventional context for supersymmetric problems arises when we consider systems containing both boson and fermion operators. In this note we consider the normal ordering problem for a string ofExpand
The ladder operator normal ordering problem for quantum confined systems and the generalization of the Stirling and Bell numbers
We solve the normal ordering problem for the ladder operators and for strings in the form for supersymmetric and shape-invariant potential systems, with r, s and n positive integers. We provide exactExpand
ec 2 00 6 A generalization of boson normal ordering
Generalizations and refinements of normal ordering have been studied in the literature (see [1, 2, 3, 4]). Here we introduce a generalization of the normal ordering for boson operator functions. TheExpand
Ladder operators' normal ordering problem for quantum-deformed systems and the (q, p)-generalization of the Stirling and Bell numbers
We resolve the ladder operators normal ordering problem for strings in the form for (q, p)-deformed supersymmetric and shape-invariant potential systems, where n is a positive integer. We provideExpand
Combinatorics and Boson normal ordering: A gentle introduction
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 theExpand
Hierarchical Dobiński-type relations via substitution and the moment problem
We consider the transformation properties of integer sequences arising from the normal ordering of exponentiated boson ([a, a†] = 1) monomials of the form exp[λ(a†)ra], r = 1, 2, ..., under theExpand


Ordering relations for q-boson operators, continued fraction techniques and the q-CBH enigma
Ordering properties of boson operators have been very extensively studied, and q-analogues of many of the relevant techniques have been derived. These relations have far reaching physicalExpand
A Characterization of the bell numbers
  • M. Aigner
  • Computer Science, Mathematics
  • Discret. Math.
  • 1999
Abstract Let B n be the Bell numbers, and A n (n⩾0) , B n (n⩾1) be the matrices defined by A n (i,j)=B i+j (0⩽i,j⩽n), B n (i,j)=B i+j+1 (0⩽i,j⩽n) . It is shown that ( B n ) is the unique sequence ofExpand
Bell numbers and coherent states
Abstract The combinatorial properties of the bell numbers are shown to follow from the algebraic properties of the boson operators in an extremely simple way. This treatment sheds further light onExpand
Concrete mathematics - a foundation for computer science
From the Publisher: This book introduces the mathematics that supports advanced computer programming and the analysis of algorithms. The primary aim of its well-known authors is to provide a solidExpand
Optical Coherence and Quantum Optics
Preface 1. Elements of probability theory 2. Random (or stochastic) processes 3. Some useful mathematical techniques 4. Second-order coherence theory of scalar wavefields 5. Radiation from sources ofExpand
Quantum Statistical Properties of Radiation
Dirac Formulation of Quantum Mechanics. Elementary Quantum Systems. Operator Algebra. Quantization of the Electromagnetic Field. Interaction of Radiation with Matter. Quantum Theory ofExpand
A Stochastic Process Interpretation of Partition Identities
The notion of compound nonhomogeneous Poisson processes provides a general framework for Bell polynomials and set partitions and identities are obtained by interpreting them as moments of such processes. Expand
Optical spectroscopy of trapped neutral atoms
ConclusionsAn overview of optical spectroscopy on trapped atoms has been presented. The subject is a hot topics in the atomic physics community and has also applications in other fields like nuclearExpand
Thermally stimulated luminescence: New perspectives in the study of defects in solids
ConclusionsThermally Stimulated Luminescence is a consolidated experimental technique, that however has not been used extensively, also due to the limited physical information it was able to produce.Expand
Fundamentals of Quantum Optics