Urn Models & Operator Ordering Procedures

View/ Open
Date
2008-03-10MFO Scientific Program
OWLF 2008Series
Oberwolfach Preprints;2008,06Author
Blasiak, Pawel
Metadata
Show full item recordOWP-2008-06
Abstract
Ordering of operators is purely combinatorial task involving a number of commutators shuffling components of operator expression to desired form. Here we show how it can be illustrated by simple urn models in which normal ordering procedure is equivalent to enumeration of urn histories.