Show simple item record

dc.contributor.authorBlasiak, Pawel
dc.date.accessioned2008-03-20T12:00:15Z
dc.date.accessioned2016-10-05T14:14:05Z
dc.date.available2008-03-20T12:00:15Z
dc.date.available2016-10-05T14:14:05Z
dc.date.issued2008-03-10
dc.identifier.urihttp://publications.mfo.de/handle/mfo/1114
dc.descriptionOWLF 2008en_US
dc.description.abstractOrdering 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.en_US
dc.language.isoenen_US
dc.publisherMathematisches Forschungsinstitut Oberwolfachen_US
dc.relation.ispartofseriesOberwolfach Preprints;2008,06
dc.titleUrn Models & Operator Ordering Proceduresen_US
dc.typePreprinten_US
dc.rights.licenseDieses Dokument darf im Rahmen von § 53 UrhG zum eigenen Gebrauch kostenfrei heruntergeladen, gelesen, gespeichert und ausgedruckt, aber nicht im Internet bereitgestellt oder an Außenstehende weitergegeben werden.de
dc.rights.licenseThis document may be downloaded, read, stored and printed for your own use within the limits of § 53 UrhG but it may not be distributed via the internet or passed on to external parties.en
dc.identifier.doi10.14760/OWP-2008-06
local.scientificprogramOWLF 2008
local.series.idOWP-2008-06
dc.identifier.urnurn:nbn:de:101:1-20080627264
dc.identifier.ppn1646253523


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record