 Character of a Young permutation module

A tabloid is fixed by a permutation exactly when each of its cycles lies wholly within one row. Assigning the distinct length-$q$ cycles to rows gives the displayed coefficient. More explicitly, sum ${\prod }_q{m}_q!/{\prod }_j{a}_{qj}!$ over nonnegative integers $a_{qj}$ with ${\sum }_j{a}_{qj}=m_q$ and ${\sum }_{q}q{a}_{qj}={\lambda }_j$. Equal-length rows remain distinguished. Thus the character counts fixed ordered row sets, rather than unordered set partitions.