Non-crossing linked partitions and multiplication of free random variables

Simple item page
dc.creatorPopa, Mihai
dc.date2008-12-11
dc.date2009-01-26
dc.date.accessioned2026-07-07T12:34:06Z
dc.date.available2026-07-07T12:34:06Z
dc.descriptionThe material gives a new combinatorial proof of the multiplicative property of the S-transform. In particular, several properties of the coefficients of its inverse are connected to non-crossing linked partitions and planar trees.
dc.description9 pages, 8 figures
dc.identifierhttps://arxiv.org/abs/0812.2064
dc.identifierhttp://arxiv.org/abs/0812.2064
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/217303
dc.subjectOperator Algebras
dc.subjectCombinatorics
dc.subject05A10; 46L54
dc.titleNon-crossing linked partitions and multiplication of free random variables
dc.typetext

Files

Collections

arXiv