Abstract: Schur polynomials form an important basis for the algebra of symmetric polynomials. When a product of two Schur polynomials is expressed in this basis, the coefficients that arise can be computed using combinatorial diagrams called Young tableaux. In this talk, we will look at the connection between the algebra and combinatorics and discuss the Littlewood-Richardson Rule, which is used to obtain these coefficients. We will then take a look at Jack polynomials, which generalize Schur polynomials via an additional parameter, and explore how one might try to also generalize the connections with Young diagrams.