Answers are grounded in this paper and cite their sources.
We prove that the positivity of symmetric group characters is PP-complete, indicating its complexity within the polynomial hierarchy.
We prove that deciding the vanishing of the character of the symmetric group is C₌P-complete. We use this hardness result to prove that the the square of the character is not contained in $#P$, unless the polynomial hierarchy collapses to the second level. This rules out the existence of any (unsigned) combinatorial description for the square of the characters. As a byproduct of our proof we conclude that deciding positivity of the character is $PP$-complete under many-one reductions, and hence $PH$-hard under Turing-reductions.
No takes yet. Share an insight, caveat, or question.
Ikenmeyer et al. (2022) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: