Algorithmically Distinguishing Irreducible Characters of the Symmetric Group from zero of the zero polynomial Watch Video

⏲ Duration: 29 min 80 sec
✓ Published: 15-Dec-2020

Description:
Timothy Chow speaks to the Experimental Mathematics Seminar.nnAbstract: Suppose χλ and χμ are two distinct irreducible characters of the symmetric group Sn. How hard is it to find a permutation π such that χλ(π) differs from χμ(π)? Surprisingly, this natural question seems not to have been considered before in the literature. One might expect that the problem is hard, since even determining whether χλ(π) is zero or not is in general NP-hard. A closely related problem is, given orac