A “Fourier Transform” for Multiplicative Functionson Non-Crossing Partitions

Authors:
Alexandru Nica;Roland Speicher
Affiliations:
affiliation{Department of Mathematics, University of Michigan,Ann Arbor, MI 48109-1003, USA E-mail:andu@math.lsa.umich.edu;Institut für Angewandte Mathematik, Universität Heidelberg,Im Neuenheimer Feld 294, D-69120 Heidelberg, Germany E-mail:roland.speicher@urz.uni-heidelberg.de
Venue:
Journal of Algebraic Combinatorics: An International Journal
Year:
1997

Citing 4
Cited 2

Enumerative combinatorics

Enumerative combinatorics
Some combinatorial problems associated with products of conjugacy classes of the symmetric group

Journal of Combinatorial Theory Series A
On the structure of the lattice of noncrossing partitions

Discrete Mathematics
Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)

Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)

Asymptotic analysis of large cooperative relay networks using random matrix theory

EURASIP Journal on Advances in Signal Processing
Cumulants and convolutions via Abel polynomials

European Journal of Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe the structure of the group of normalizedmultiplicative functions on lattices of non-crossing partitions. Asan application, we give a combinatorial proof of a theorem of D.Voiculescu concerning the multiplication of free random variables