Urn models & operator ordering procedures

dc.bibliographicCitation.seriesTitleOberwolfach Preprints (OWP)eng
dc.bibliographicCitation.volume2008-06
dc.contributor.authorBlasiak, Pawel
dc.date.available2019-06-28T08:25:33Z
dc.date.issued2008
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.eng
dc.description.versionpublishedVersioneng
dc.formatapplication/pdf
dc.identifier.issn1864-7596
dc.identifier.urihttps://doi.org/10.34657/3476
dc.identifier.urihttps://oa.tib.eu/renate/handle/123456789/3449
dc.language.isoengeng
dc.publisherOberwolfach : Mathematisches Forschungsinstitut Oberwolfacheng
dc.relation.doihttps://doi.org/10.14760/OWP-2008-06
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.eng
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.ger
dc.subject.ddc510eng
dc.titleUrn models & operator ordering procedureseng
dc.typeReporteng
dc.typeTexteng
tib.accessRightsopenAccesseng
wgl.contributorMFOeng
wgl.subjectMathematikeng
wgl.typeReport / Forschungsbericht / Arbeitspapiereng
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
OWP2008_06.pdf
Size:
207.04 KB
Format:
Adobe Portable Document Format
Description: