A p-group analogue to symmetric group combinatorics IINat Thiem, CU |
September 30 AbstractThe symmetric group has a well-known and beautiful combinatorial structure inextricably linked with the ring of symmetric functions. In the first of two talks, we will review the combinatorial structure of the character theory of the symmetric group and its relation to the ring of symmetric functions. In the second, we will explore an analogue obtained via the supercharacter theory of the finite groups of unipotent upper-triangular matrices. |