Graded representation theory

Let be a group and let be a graded representation of , i.e. a functor from to the category of graded vector spaces with each piece finite-dimensional. Thus acts on each graded piece individually, each of which is an ordinary finite-dimensional representation. We want to define a character associated to a graded representation, but if [...]

Read Full Post »

The Jacobi-Trudi identities

Today I’d like to introduce a totally explicit combinatorial definition of the Schur functions. Let be a partition. A semistandard Young tableau of shape is a filling of the Young diagram of with positive integers that are weakly increasing along rows and strictly increasing along columns. The weight of a tableau is defined as where [...]

Read Full Post »

The many faces of Schur functions

The last time we talked about symmetric functions, I asked whether the vector space could be turned into an algebra, i.e. equipped with a nice product. It turns out that the induced representation allows us to construct such a product as follows: Given representations of , their tensor product is a representation of the direct [...]

Read Full Post »

Set-multiset duality and supervector spaces

Recall that the elementary symmetric functions generate the ring of symmetric functions as a module over any commutative ring . A corollary of this result, although I didn’t state it explicitly, is that the elementary symmetric functions are algebraically independent, hence any ring homomorphism from the symmetric functions is determined freely by the images of [...]

Read Full Post »

Newton’s sums, necklace congruences, and zeta functions II

In a previous post I gave essentially the following definition: given a discrete dynamical system, i.e. a space and a function , and under the assumption that has a finite number of fixed points for all , we define the dynamical zeta function to be the formal power series . What I didn’t do was [...]

Read Full Post »

Newton’s sums, necklace congruences, and zeta functions

The goal of this post is to give a purely combinatorial proof of Newton’s sums which would have interrupted the flow of the previous post. Recall that, in the notation of the previous post, Newton’s sums (also known as the first Newton-Girard identity) state that . One way to motivate a combinatorial proof is to [...]

Read Full Post »

Introduction to symmetric functions

The theory of symmetric functions, which generalizes some ideas that came up in the previous discussion of Polya theory, can be motivated by thinking about polynomial functions of the roots of a monic polynomial . Problems on high school competitions often ask for the sum of the squares or the cubes of the roots of [...]

Read Full Post »

GILA V: The Polya enumeration theorem and applications

I ended the last post by asking whether the proof of baby Polya extends to the multi-parameter setting where we want to keep track of how many of each color we use. In fact, it does. First, we should specify what exactly we’re trying to compute. Recall the setup: we have colors (represented by variables [...]

Read Full Post »