Normal Order: Combinatorial Graphs

Details Normal Order: Combinatorial Graphs Normal Order: Combinatorial Graphs

2004-02-12

arxiv.org/abs/quant-ph/0402082v1

Physics

Quantum Physics

7 pages, 15 references, 2 figures. Presented at "Progress in Supersymmetric Quantum Mechanics" (PSQM'03), Valladolid, Spain, J

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Normal Order: Combinatorial Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Normal Order: Combinatorial Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Normal Order: Combinatorial Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-452488