Pages that link to "Item:Q855850"
From MaRDI portal
The following pages link to On the number of factorizations of a full cycle (Q855850):
Displaying 16 items.
- On the matchings-Jack conjecture for Jack connection coefficients indexed by two single part partitions (Q276196) (← links)
- Near-central permutation factorization and Strahov's generalized Murnaghan-Nakayama rule (Q444916) (← links)
- The number of shortest paths in the arrangement graph (Q497229) (← links)
- Polynomial properties of Jack connection coefficients and generalization of a result by Dénes (Q894239) (← links)
- Nombre de factorisations d'un grand cycle (Number of factorizations of a large cycle) (Q1423021) (← links)
- Moments of normally distributed random matrices given by generating series for connection coefficients -- explicit bijective computation (Q1684294) (← links)
- The Oberwolfach problem and factors of uniform odd length cycles (Q1825209) (← links)
- Direct bijective computation of the generating series for 2 and 3-connection coefficients of the symmetric group (Q1953481) (← links)
- Two enumerative results on cycles of permutations (Q2275480) (← links)
- Moments of normally distributed random matrices given by generating series for connection coefficients -- explicit algebraic computation (Q2344790) (← links)
- The number of shortest paths in the (n, k)-star graph (Q2931914) (← links)
- (Q3147270) (← links)
- (Q4242740) (← links)
- Minimal factorizations of a cycle: a multivariate generating function (Q5110958) (← links)
- On Jack's connection coefficients and their computation (Q5239569) (← links)
- On the matchings-Jack and hypermap-Jack conjectures for labelled matchings and star maps (Q6614159) (← links)
