The Open UniversitySkip to content
 

Normal order: combinatorial graphs

Solomon, Allan I.; Duchamp, Gerard; Blasiak, Pawel; Horzela, Andrzej and Penson, Karol A. (2003). Normal order: combinatorial graphs. In: Progress in Supersymmetric Quantum Mechanics (PSQM'03), Jul 2003, Valladolid, Spain.

URL: http://xxx.lanl.gov/abs/quant-ph/0402082
Google Scholar: Look up in Google Scholar

Abstract

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

Item Type: Conference Item
Academic Unit/Department: Science > Physical Sciences
Item ID: 4893
Depositing User: Users 6041 not found.
Date Deposited: 14 Jul 2006
Last Modified: 02 Dec 2010 19:52
URI: http://oro.open.ac.uk/id/eprint/4893
Share this page:

Actions (login may be required)

View Item
Report issue / request change

Policies | Disclaimer

© The Open University   + 44 (0)870 333 4340   general-enquiries@open.ac.uk