1 - 1 of 1 results for: MATH263A

Symmetric function theory unifies large parts of combinatorics. Theorems about permutations, partitions, and graphs now follow in a unified way. Topics: The usual bases (monomial, elementary, complete, and power sums). Schur functions. Representation theory of the symmetric group. Littlewood-Richardson rule, quasi-symmetric functions, combinatorial Hopf algebras, introduction to Macdonald polynomials. Throughout, emphasis is placed on applications (e.g. to card shuffling and random matrix theory). Prerequisite: 210A and 210B, or equivalent.