Minimal factorizations of a cycle and central multiplicative functions on the infinite symmetric group

Journal of Combinatorial Theory. Series A

Volumn 76, Issue 2, 1996, Pages 197-212

  Biane, Philippe ^a,b  

^a CNRS   (France)

^b ECOLE NORMALE SUPÉRIEURE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030295693     PISSN: 00973165     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcta.1996.0101     Document Type: Article

References (18)

1. [Be] C. Berge, "Principes de Combinatoire," Dunod, Paris, 1968.
2. [Bi] P. Biane, Some properties of crossings and partitions, Discrete Math., to appear.
3. [De] J. Denes, The representation of a permutation as the product of a minimal number of transpositions and its connection with the theory of graphs, Publ. Math. Inst. Hungar. Acad. Sci. 4 (1959), 63-70.
4. [Du] S. Dulucq and J. G. Penaud, Cordes, arbres et permutations, Discrete Math. 117 (1993), 89-105.
5. [D-N-V] K. J. Dykema, A. Nica, and D. V. Voiculescu, "Free Random Variables," CRM Monograph Series, Vol. 1, 1993.
6. [E1] P. Edelman, Chain enumeration and non-crossing partitons, Discrete Math. 31 (1980), 171-180.
7. [E2] P. Edelman, Multichains, non-crossing partitions and trees, Discrete Math. 40 (1982), 171-179.
8. [G-J] I. P. Goulden and D. M. Jackson, Symmetric functions and Macdonald's result for top connexion coefficients in the symmetric group, J. Algebra 166, No. 2 (1994), 364-378.
9. [G-P] I. P. Goulden and S. Pepper, Labelled trees and factorisations of a cycle into transpositions, Discrete Math. 113 (1993), 263-268.
10. [J] A. Joyal, Une théorie combinatoire des séries formelles, Adv. Math. 42 (1981), 1-82.
11. [K-V] S. V. Kerov and A. M. Vershik, Characters and factor representations of the infinite symmetric group, Soviet. Math. Dokl. 23 (1982), 389-392.
12. [K] G. Kreweras, Sur les partitions non-croisées d'un cycle, Discrete Math. 1 (1972), 333-350.
13. [M] P. Moszkowski, A solution to a problem of Dénes, a bijection between trees and factorizations of cyclic permutations, European J. Combin. 101 (1989), 13-16.
14. [N-S] A. Nica and R. Speicher, A "Fourier Transform" for multiplicative functions on non-crossing partitions, J. Algebraic Combin., to appear.
15. [P] Y. Poupard, Étude et dénombrement parallèles des partitions non-croisées d'un cycle et des coupages d'un polygone convexe, Discrete Math. 2 (1972), 279-288.
16. [S1] R. Speicher, A new example of "independence" and "white noise", Prob. Theory Related Fields 84 (1990), 141-159.
17. [S2] R. Speicher, Multiplicative functions on the lattice of non-crossing partitions, Math. Ann. 298 (1994), 611-628.
18. [S-U] R. Simion and D. Ullman, On the structure of the lattice of non-crossing partitions, Discrete Math. 98 (1991), 193-206.