pith. sign in

arxiv: quant-ph/0310174 · v1 · submitted 2003-10-29 · 🪐 quant-ph · math.CO

Combinatorial Physics, Normal Order and Model Feynman Graphs

classification 🪐 quant-ph math.CO
keywords combinatorialnumbersfeynmanproblembosonclassesdiagramsfunctions
0
0 comments X
read the original abstract

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 Stirling 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.