We consider the numbers arising in the problem of normal ordering of
expressions in canonical boson creation and annihilation operators. We treat a
general form of a boson string which is shown to be associated with
generalizations of Stirling and Bell numbers. The recurrence relations and
closed-form expressions (Dobiski-type formulas) are obtained for these
quantities by both algebraic and combinatorial methods. By extensive use of
methods of combinatorial analysis we prove the equivalence of the
aforementioned problem to the enumeration of special families of graphs. This
link provides a combinatorial interpretation of the numbers arising in this
normal ordering problem.
%0 Generic
%1 citeulike:210599
%A Mendez, M. A.
%A Blasiak, P.
%A Penson, K. A.
%D 2005
%K boson normal ordering problem
%T Combinatorial approach to generalized Bell and Stirling numbers and boson normal ordering problem
%U http://arxiv.org/abs/quant-ph/0505180
%X We consider the numbers arising in the problem of normal ordering of
expressions in canonical boson creation and annihilation operators. We treat a
general form of a boson string which is shown to be associated with
generalizations of Stirling and Bell numbers. The recurrence relations and
closed-form expressions (Dobiski-type formulas) are obtained for these
quantities by both algebraic and combinatorial methods. By extensive use of
methods of combinatorial analysis we prove the equivalence of the
aforementioned problem to the enumeration of special families of graphs. This
link provides a combinatorial interpretation of the numbers arising in this
normal ordering problem.
@misc{citeulike:210599,
abstract = {We consider the numbers arising in the problem of normal ordering of
expressions in canonical boson creation and annihilation operators. We treat a
general form of a boson string which is shown to be associated with
generalizations of Stirling and Bell numbers. The recurrence relations and
closed-form expressions (Dobiski-type formulas) are obtained for these
quantities by both algebraic and combinatorial methods. By extensive use of
methods of combinatorial analysis we prove the equivalence of the
aforementioned problem to the enumeration of special families of graphs. This
link provides a combinatorial interpretation of the numbers arising in this
normal ordering problem.},
added-at = {2007-08-18T13:22:24.000+0200},
author = {Mendez, M. A. and Blasiak, P. and Penson, K. A.},
biburl = {https://www.bibsonomy.org/bibtex/295ccd1b840d34fba92f7c0514ac37d27/a_olympia},
citeulike-article-id = {210599},
description = {citeulike},
eprint = {quant-ph/0505180},
interhash = {fc39accc2fab49cc7037b7d0e9faf9e2},
intrahash = {95ccd1b840d34fba92f7c0514ac37d27},
keywords = {boson normal ordering problem},
month = May,
priority = {2},
timestamp = {2007-08-18T13:22:49.000+0200},
title = {Combinatorial approach to generalized Bell and Stirling numbers and boson normal ordering problem},
url = {http://arxiv.org/abs/quant-ph/0505180},
year = 2005
}