Understanding combinatorial rules for decomposing tensor products of irreducible representations has been an area of active research in various contexts for the past several decades. In the case of GL_n representations, the most famous rule is the Littlewood-Richardson rule. In this talk, we will give another rule using domino tableaux. This approach has the added advantage that it can compute the symmetric square and alternating square of an irreducible representation as well. Speaker(s): Viswambhara Makam (University of Michigan)