Nonzero coefficients in restrictions and tensor products of supercharacters of
arXiv:0912.1880
Abstract
The standard supercharacter theory of the finite unipotent upper-triangular matrices gives rise to a beautiful combinatorics based on set partitions. As with the representation theory of the symmetric group, embeddings of for lead to branching rules. Diaconis and Isaacs established that the restriction of a supercharacter of is a nonnegative integer linear combination of supercharacters of (in fact, it is polynomial in ). In a first step towards understanding the combinatorics of coefficients in the branching rules of the supercharacters of , this paper characterizes when a given coefficient is nonzero in the restriction of a supercharacter and the tensor product of two supercharacters. These conditions are given uniformly in terms of complete matchings in bipartite graphs.
28 pages