相关论文: Combinatorics and Boson normal ordering: A gentle …
We show that the combinatorial numbers known as {\em Bell numbers} are generic in quantum physics. This is because they arise in the procedure known as {\em Normal ordering} of bosons, a procedure which is involved in the evaluation of…
We treat the problem of normally ordering expressions involving the standard boson operators a, a* where [a,a*]=1. We show that a simple product formula for formal power series - essentially an extension of the Taylor expansion - leads to a…
Set partitions and permutations with restrictions on the size of the blocks and cycles are important combinatorial sequences. Counting these objects lead to the sequences generalizing the classical Stirling and Bell numbers. The main focus…
In this paper, we discuss combinatorial aspects of normal ordering of 3-dimensional skew polynomial rings defined and classified by Bell and Smith \cite{BellSmith1990}. With some help of the Mathematical software \texttt{SageMath}, we are…
An archetypal problem discussed in computer science is the problem of searching for a given number in a given set of numbers. Other than sequential search, the classic solution is to sort the list of numbers and then apply binary search.…
We investigate the algebra generated by the operators $x$ and $\mathrm{I} = \int_0^x$, which satisfy the commutation relation \[ [\mathrm{I},x] = \mathrm{I}x - x\mathrm{I} = - \mathrm{I}^2. \] We develop a combinatorial framework for the…
In quantum mechanics, bosonic operators are mathematical objects that are used to represent the creation ($a^\dagger$) and annihilation ($a$) of bosonic particles. The natural power of a linear combination of bosonic operators represents an…
Normally ordered forms of functions of boson operators are important in many contexts in particular concerning Quantum Field Theory and Quantum Optics. Beginning with the seminal work of Katriel [Lett. Nuovo Cimento, 10(13):565--567, 1974],…
A combinatorial methods are used to investigate some properties of certain generalized Stirling numbers, including explicit formula and recurrence relations. Furthermore, an expression of these numbers with symmetric function is deduced.
Given an ordered set partition, when one insert a number of bars in-between the blocks of the ordered set partition the result is a barred preferential arrangement. In this study, using the notion of barred preferential arrangements we…
In a soliton sector of a quantum field theory, it is often convenient to expand the quantum fields in terms of normal modes. Normal mode creation and annihilation operators can be normal ordered, and their normal ordered products have…
The purpose of this paper is to investigate the connection between context-free grammars and normal ordering problem, and then to explore various extensions of the Stirling grammar. We present grammatical characterizations of several well…
The problem of ordering operators has afflicted quantum mechanics since its foundation. Several orderings have been devised, but a systematic procedure to move from one ordering to another is still missing. The importance of establishing…
The Bin Packing Problem involves efficiently packing items into a limited number of bins without exceeding their capacity. In this paper, we try to answer a specific question in this field. Mathematically the combinatorial optimization…
We derive a normal ordering formula for the operator \((xI)^n\), where \(I\) denotes the Volterra operator. The resulting coefficients are shown to coincide with the Bessel numbers. We also present two applications, along with a…
Multiobjective combinatorial optimization deals with problems considering more than one viewpoint or scenario. The problem of aggregating multiple criteria to obtain a globalizing objective function is of special interest when the number of…
The problem of ranking can be described as follows. We have a set of combinatorial objects $S$, such as, say, the k-subsets of n things, and we can imagine that they have been arranged in some list, say lexicographically, and we want to…
The normal ordering formulae for powers of the boson number operator $\hat{n}$ are extended to deformed bosons. It is found that for the `M-type' deformed bosons, which satisfy $a a^{\dagger} - q a^{\dagger} a = 1$, the extension involves a…
The paper focuses on some versions of connected dominating set problems: basic problems and multicriteria problems. A literature survey on basic problem formulations and solving approaches is presented. The basic connected dominating set…
Wick's theorem provides a connection between time ordered products of bosonic or fermionic fields, and their normal ordered counterparts. We consider a generic pair of operator orderings and we prove, by induction, the theorem that relates…