All Questions
1 question
4
votes
1
answer
528
views
The number of permutations of a given cycle type that fix a string with a given histogram
Let $\lambda$ and $\mu$ be partitions of some integer $n \geq 1$. Let $d$ be the number of parts in $\mu$ and let $\bar{\mu} \in \{1,\dotsc,d\}^n$ denote the string $1^{\mu_1} 2^{\mu_2} \dotsb d^{\...