Related papers: Some useful combinatorial formulae for bosonic ope…
A representation of the perturbation series of a general functional measure is given in terms of generalized Feynman graphs and -rules. The graphical calculus is applied to certain functional measures of L\'evy type. A graphical notion of…
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…
We propose a new generalization of the standard (anti-)commutation relations for creation and annihilation operators of bosons and fermions. These relations preserve the usual symmetry properties of bosons and fermions. Only the standard…
Interest in combinatorial interpretations of mathematical entities stems from the convenience of the concrete models they provide. Finding a bijective proof of a seemingly obscure identity can reveal unsuspected significance to it. Finding…
To a word $w$, we associate the rational function $\Psi_w = \prod (x_{w_i} - x_{w_{i+1}})^{-1}$. The main object, introduced by C. Greene to generalize identities linked to Murnaghan-Nakayama rule, is a sum of its images by certain…
The machinery of computing vacuum expectation values of a time-ordered sequence of position operators of the simple harmonic oscillator is already well established. It rests on a Wick theorem, which enables one to decompose such a quantity…
From the standard procedure for constructing Feynman vacuum graphs in $\phi^4$ theory from the generating functional $Z$, we find a relation with sets of certain combinatorial matrices, which allows us to generate the set of all Feynman…
We study a combinatorial model of the quantum scalar field with polynomial potential on a graph. In the first quantization formalism, the value of a Feynman graph is given by a sum over maps from the Feynman graph to the spacetime graph…
We define an enumerative function F(n,k,P,m) which is a generalization of binomial coefficients. Special cases of this function are also power function, factorials, rising factorials and falling factorials. The first section of the paper is…
We present a construction of fermionic operators in 3+1 dimensions in terms of bosonic fields in the framework of $QED_4$. The basic bosonic variables are the electric fields $E_i$ and their conjugate momenta $A_i$. Our construction…
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 completely generalize previous results related to the counting of connected Feynman diagrams. We use a generating function approach, which encodes the Wick contraction combinatorics of the respective connected diagrams. Exact solutions…
In this paper, we present a Hopf algebra description of a bosonic quantum model, using the elementary combinatorial elements of Bell and Stirling numbers. Our objective in doing this is as follows. Recent studies have revealed that…
It is shown that a SU(1,1) algebra may be used to provide a unified description of the simple hamonic oscillator and the angular momentum algebras and a class of other semi-infinite algebras. A normal ordered representation of a Unitary…
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…
Counting the contribution rate of a world-line formula to Feynman diagrams in $\phi^3$ theory, we explain the idea how to determine precise combinatorics of Bern-Kosower-like amplitudes derived from a bosonic string theory for $N$-point…
Let $W$ denote a simply-laced Coxeter group with $n$ generators. We construct an $n$-dimensional representation $\phi$ of $W$ over the finite field $F_2$ of two elements. The action of $\phi(W)$ on $F_2^n$ by left multiplication is…
We give the normal and anti-normal order expressions of the number operator to the power $k$ by using the commutation relation between the annihilation and creation operators. We use those expressions to give general formulae for functions…
The concern of this paper is a famous combinatorial formula known under the name "exponential formula". It occurs quite naturally in many contexts (physics, mathematics, computer science). Roughly speaking, it expresses that the exponential…
In this talk, we are concerned with the formulation and understanding of the combinatorics of time-ordered n-point functions in terms of the Hopf algebra of field operators. Mathematically, this problem can be formulated as one in…