اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدCombinatorial Solutions to Normal Ordering of Bosons
60
0
0.0
(
0
)
تأليف
P. Blasiak
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We present a combinatorial method of constructing solutions to the normal ordering of boson operators. Generalizations of standard combinatorial notions - the Stirling and Bell numbers, Bell polynomials and Dobinski relations - lead to calculational tools which allow to find explicitly normally ordered forms for a large class of operator functions.
قيم البحث
اقرأ أيضاً
We construct and analyze a family of coherent states built on sequences of integers originating from the solution of the boson normal ordering problem. These sequences generalize the conventional combinatorial Bell numbers and are shown to be moments
of positive functions. Consequently, the resulting coherent states automatically satisfy the resolution of unity condition. In addition they display such non-classical fluctuation properties as super-Poissonian statistics and squeezing.
We solve the normal ordering problem for (A* A)^n where A* (resp. A) are one mode deformed bosonic creation (resp. annihilation) operators satisfying [A,A*]=[N+1]-[N]. The solution generalizes results known for canonical and q-bosons. It involves com
binatorial polynomials in the number operator N for which the generating functions and explicit expressions are found. Simple deformations provide examples of the method.
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 of such operators. In the general case, upon which we to
uch briefly, this problem leads to combinatorial numbers, the so-called Rook numbers. Since we assume that the two species, bosons and fermions, commute, we subsequently restrict ourselves to consideration of a single species, single-mode boson monomials. This problem leads to elegant generalisations of well-known combinatorial numbers, specifically Bell and Stirling numbers. We explicitly give the generating functions for some classes of these numbers. In this note we concentrate on the combinatorial graph approach, showing how some important classical results of graph theory lead to transparent representations of the combinatorial numbers associated with the boson normal ordering problem.
The general normal ordering problem for boson strings is a combinatorial problem. In this note we restrict ourselves to single-mode boson monomials. This problem leads to elegant generalisations of well-known combinatorial numbers, such as Bell and S
tirling numbers. We explicitly give the generating functions for some classes of these numbers. Finally we show that a graphical representation of these combinatorial numbers leads to sets of model field theories, for which the graphs may be interpreted as Feynman diagrams corresponding to the bosons of the theory. The generating functions are the generators of the classes of Feynman diagrams.
In this paper, we show that the infinite generalised Stirling matrices associated with boson strings with one annihilation operator are projective limits of approximate substitutions, the latter being characterised by a finite set of algebraic equations.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
