Nombre de factorisations d'un grand cycle (Number of factorizations of a large cycle)
From MaRDI portal
Publication:1423021
zbMath1035.05005arXivmath/0307147MaRDI QIDQ1423021
Publication date: 12 February 2004
Published in: Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0307147
Exact enumeration problems, generating functions (05A15) Symmetric functions and generalizations (05E05)
Related Items (13)
On the matchings-Jack conjecture for Jack connection coefficients indexed by two single part partitions ⋮ On the number of factorizations of a full cycle ⋮ Moments of normally distributed random matrices given by generating series for connection coefficients -- explicit bijective computation ⋮ Polynomial properties of Jack connection coefficients and generalization of a result by Dénes ⋮ Direct bijective computation of the generating series for 2 and 3-connection coefficients of the symmetric group ⋮ Odd permutations are nicer than even ones ⋮ Near-central permutation factorization and Strahov's generalized Murnaghan-Nakayama rule ⋮ Two enumerative results on cycles of permutations ⋮ Degrees in random uniform minimal factorizations ⋮ The geometry of random minimal factorizations of a long cycle via biconditioned bitype random trees ⋮ Random generation and scaling limits of fixed genus factorizations into transpositions ⋮ Moments of normally distributed random matrices given by generating series for connection coefficients -- explicit algebraic computation ⋮ Combinatorial and algebraic enumeration: a survey of the work of Ian P. Goulden and David M. Jackson
This page was built for publication: Nombre de factorisations d'un grand cycle (Number of factorizations of a large cycle)
