Computational Complexity in Column Sums of Symmetric Group Characters

Explore a 46-minute mathematics lecture examining the computational complexity aspects of symmetric group character column sums. Delve into the character table of the symmetric group $S_n$ and its significance in theoretical physics, combinatorics, and computational complexity theory. Learn about an identity with geometric interpretation in combinatorial topological field theories that connects normalized central characters of $S_n$ to structure constants in the group algebra's center. Discover how this identity proves that calculating column sums falls within the #P complexity class. Examine the relationship between structure constants and branched covers of the sphere, focusing on a tractable subset related to genus zero covers. Understand the proof that column sums for conjugacy classes labeled by partition λ are non-zero only when the permutations are even, leading to the classification of column sum vanishing determination within complexity class P.