No Arabic abstract
We consider the transformation properties of integer sequences arising from the normal ordering of exponentiated boson ([a,a*]=1) monomials of the form exp(x (a*)^r a), r=1,2,..., under the composition of their exponential generating functions (egf). They turn out to be of Sheffer-type. We demonstrate that two key properties of these sequences remain preserved under substitutional composition: (a)the property of being the solution of the Stieltjes moment problem; and (b) the representation of these sequences through infinite series (Dobinski-type relations). We present a number of examples of such composition satisfying properties (a) and (b). We obtain new Dobinski-type formulas and solve the associated moment problem for several hierarchically defined combinatorial families of sequences.
We consider sequences of generalized Bell numbers B(n), n=0,1,... for which there exist Dobinski-type summation formulas; that is, where B(n) is represented as an infinite sum over k of terms P(k)^n/D(k). These include the standard Bell numbers and their generalizations appearing in the normal ordering of powers of boson monomials, as well as variants of the ordered Bell numbers. For any such B we demonstrate that every positive integral power of B(m(n)), where m(n) is a quadratic function of n with positive integral coefficients, is the n-th moment of a positive function on the positive real axis, given by a weighted infinite sum of log-normal distributions.
We consider properties of the operators D(r,M)=a^r(a^dag a)^M (which we call generalized Laguerre-type derivatives), with r=1,2,..., M=0,1,..., where a and a^dag are boson annihilation and creation operators respectively, satisfying [a,a^dag]=1. We obtain explicit formulas for the normally ordered form of arbitrary Taylor-expandable functions of D(r,M) with the help of an operator relation which generalizes the Dobinski formula. Coherent state expectation values of certain operator functions of D(r,M) turn out to be generating functions of combinatorial numbers. In many cases the corresponding combinatorial structures can be explicitly identified.
We investigate properties of exponential operators preserving the particle number using combinatorial methods developed in order to solve the boson normal ordering problem. In particular, we apply generalized Dobinski relations and methods of multivariate Bell polynomials which enable us to understand the meaning of perturbation-like expansions of exponential operators. Such expansions, obtained as formal power series, are everywhere divergent but the Pade summation method is shown to give results which very well agree with exact solutions got for simplified quantum models of the one mode bosonic systems.
We map the quantum entanglement problem onto the mathematically well-studied truncated moment problem. This yields a necessary and sufficient condition for separability that can be checked by a hierarchy of semi-definite programs. The algorithm always gives a certificate of entanglement if the state is entangled. If the state is separable, typically a certificate of separability is obtained in a finite number of steps and an explicit decomposition into separable pure states can be extracted.
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, satisfying [a,a*]=1. This leads to exponential operators generalizing the shift operator and we show that their action can be expressed in terms of substitutions. Our solution is naturally related through the coherent state representation to the exponential generating functions of Sheffer-type polynomials. This in turn opens a vast arena of combinatorial methodology which is applied to boson normal ordering and illustrated by a few examples.