Pages that link to "Item:Q855850"

The following pages link to On the number of factorizations of a full cycle (Q855850):

Displaying 10 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)
• 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)
• 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)
• (Q5239569) (← links)