Suppose $\mu$ is a fixed partition of $n$ of length $l(\mu)$, and I was encountered with the following sum, namely
$\sum\_{\nu} \chi\_{\nu}(\mu)$.


I did some calculation using the character table that I can find (mainly Fulton & Harris's book, they have the character table up to $S\_5$), and found that the sum does not vanish only if $\mu$ has an even number of even parts(someone call such $\mu$ an orthogonal partition). 


This is actually very simple to prove, only use the fact that 
$\chi\_{\nu^t}(\mu)=(-1)^{n-l(\mu)} \chi\_{\nu}(\mu)$, if $\mu$ has an odd number of even parts, then $n-l(\mu)$ is odd.


But my calculation indicates more: the sum is nonzero only if every even part of $\mu$ occurs even times.(someone also call such partition an orthogonal partition, and I donot know which is the correct definition...can anyone help?)


I checked this for $n \leq 6$ and also for $n=11$ (I found the charater table of $S\_{11}$ in some paper...)


I donot know whether this is just an coincidence or this is always true. 


Since my knowledge of symmetric group is very limited, I donot hesitate to ask for help on MO. Hopefully, someone will give me an answer. Thank you all!


p.s. (1) My second question, which is quite related to the above one. We know that 
$\sum\_{\nu} s\_{\nu}(x) s\_{\nu}(y)=\prod\_{i,j} \frac{1}{1-x\_i y\_j}$, where $s\_{\nu}$ is the Schur function.
Is there a similar expression for $\sum\_{\nu} s\_{\nu}$?


(2) My third question: Is there a similar expression for $\sum\_{\nu} (\frac{|\nu|!}{dim R\_{\nu}})^k s\_{\nu}$? Here $R\_{\nu}$ is the irreducible representation indexed by $\nu$, and $k$ is a positive integer.



sum of the character of the symmetric group
Your conjecture is correct; as a matter of fact, it is possible to compute these sums $C(\mu):=\sum\_\nu\chi\_\nu(\mu)$ exactly for any $\mu$:


Suppose $\mu$ has $m\_i$ parts of length $i$, for $i=1,2,\ldots$. Then $C(\mu)=\prod\_{i>0} c\_{i,m\_i}$, where $c\_{i,m\_i}$ is the coefficient of $t^{m\_i}/({m\_i}!)$ in $\exp(t+\frac{1}{2}it^2)$ if $i$ is odd, or in $\exp(\frac{1}{2}it^2)$ if $i$ is even. 


A first proof can be found in Macdonald's *Symmetric functions and Hall polynomials*, ex.11 p.122; it relies on symmetric function techniques. A second one is given in Stanley's *Enumerative Combinatorics Vol. 2*, ex. 7.69, and is based on the fact that, from a general character theory result, $C(\mu)$ is the number of square roots of a given permutation of cycle-type $\mu$.


