Pages that link to "Item:Q1423021"
From MaRDI portal
The following pages link to Nombre de factorisations d'un grand cycle (Number of factorizations of a large cycle) (Q1423021):
Displaying 13 items.
- On the matchings-Jack conjecture for Jack connection coefficients indexed by two single part partitions (Q276196) (← links)
- Odd permutations are nicer than even ones (Q444404) (← links)
- Near-central permutation factorization and Strahov's generalized Murnaghan-Nakayama rule (Q444916) (← links)
- On the number of factorizations of a full cycle (Q855850) (← links)
- Polynomial properties of Jack connection coefficients and generalization of a result by Dénes (Q894239) (← links)
- Moments of normally distributed random matrices given by generating series for connection coefficients -- explicit bijective computation (Q1684294) (← links)
- Direct bijective computation of the generating series for 2 and 3-connection coefficients of the symmetric group (Q1953481) (← links)
- Degrees in random uniform minimal factorizations (Q2065894) (← links)
- Random generation and scaling limits of fixed genus factorizations into transpositions (Q2099811) (← links)
- Combinatorial and algebraic enumeration: a survey of the work of Ian P. Goulden and David M. Jackson (Q2109218) (← links)
- Two enumerative results on cycles of permutations (Q2275480) (← links)
- The geometry of random minimal factorizations of a long cycle via biconditioned bitype random trees (Q2323049) (← links)
- Moments of normally distributed random matrices given by generating series for connection coefficients -- explicit algebraic computation (Q2344790) (← links)
