made more explicit (here) the formula in terms of ssYT for the case of finite number of variables

]]>added (here) the equivalent description in terms of sums over semistandard Young tableaux.

(Wrote this as a proposition under “Properties”, but c iting Sagan01, who gives this as the definition. Need to give a reference for the proof of the equivalence to the original Jacobi-style definition.)

]]>I have now made fully explicit (here) all the ingredients that go into the Frobenius formula

]]>Yes, thanks, I had followed your links here, where the statement is recorded (out of the blue) as Def. 2 there.

The only reference given in that post is to

- Richard Stanley,
*Enumerative Combinatorics 2*, Cambridge University Press (1999, 2010) (doi:10.1017/CBO9780511609589, webpage)

but I don’t see the formula in there either. In his other post he cites Sagan, though, and so possibly that’s again the source from which he got that formula.

]]>Well done! I’d only seen it in Qiaochu Yuan’s post.

]]>added pointer to Sagan’s textbook and encyclopedia article, and pointer to where in there the Frobenius formula

$s_\lambda \;=\; \frac{1}{n!} \underset {\sigma \in Sym(n)} {\sum} \chi^{(\lambda)}(\sigma) \cdot p_\sigma$is discussed.

(I did not find it mentioned in either of Macdonald’s, James’s or Diaconis’ textbook)

]]>