Claremont Center for the Mathematical Sciences

If the results of your election procedure can be realized as a matrix-vector product, then the representation theory of the symmetric group can probably say something interesting about the way you are voting. In this talk, I'll explain why this is the case by (introducing and) using only a handful of simple combinatorial objects (e.g., tabloids) and some basic ideas from representation theory (e.g., Schur¹s Lemma) to recast and extend some well-known results in the field of voting theory. This is joint work with Zajj Daugherty, Alex Eustis, and Greg Minton.