Symmetric Functions 0

I’ll be gone on vacation until the end of the month and won’t be posting. When I come back I plan to write more about symmetric functions, starting from scratch and hopefully reaching eventually something about Macdonald polynomials. I will be teaching a graduate class on representation theory of finite groups this Fall and I see this project as preparing the lectures for the second half of the course.

The standard reference (“the scriptures” as Schiffmann put it in his talk at AIM) is Ian G. Macdonald’s book: Symmetric functions and Hall polynomials. Second edition. Oxford Mathematical Monographs. Oxford Science Publications. The Clarendon Press, Oxford University
Press, New York, 1995. x+475 pp. ISBN 0-19-853489-2. (The second edition is more that just a cosmetic change of the first.)

This book is truly amazing. There’s absolutely no fat in it. This, however, can make it a bit hard to get into. In my case, the motivation to read it came from needing his description of the irreducible characters of GL_n (k), with k a finite field (chapter IV), which is in turn based on the original description by Green. I was hooked.

Symmetric functions are at the very least a fantastic computational tool. They can be used to package quite a bit of information in a very concise form. Typically this information is combinatorial or related to representations of certain finite groups (the symmetric group, obviosuly, but also, as mentioned above, GL_n(k) and so on). This is already evident in the description by Frobenius of the irreducible characters of the symmetric groups. In a situation that is quite typical the values of the characters (the character table) appear as the transition matrix (i.e. a change of basis matrix) between two natural bases of the ring \Lambda of symmetric functions in infinitely many variables: the power sums and the Schur functions. (I can’t refrain from quoting Macdonald to the effect that elements of \Lambda, itself a limit of polynomial rings, are neither polynomials nor functions but we have to call them something! See his paper “A new class of symmetric functions”, Publ. IRMA Strasbourg, 1988 372/S-20, Actes 20e Seminaire Lotharingien, p. 131-171, were he introduces the Macdonald polynomials. )

We also know from the work of Haiman that symmetric functions are relevant to the geometry of Hilbert schemes. My experience with our work with Hausel and Letellier is that they are also crucial to understanding the cohomology of character varieties. I am convinced that tough we use them mostly as a computational device the connection goes well beyond that.

Non-sequitur: Farshid Hajir pointed out during my talk in Amherst last Fall that Frobenius appeared in it in three different forms: 1) the Frobenius substitution, the absolute bread and butter of Number Theory, 2) the trace formula expressing the number of points of a character variety over a finite field in terms of irreducible characters of the target group and 3) Frobenius algebras, the building block of topological field theories. Frobenius was just amazing! I highly recommend his Collected Works; I would bet money that there’s still a lot to be dug up from them.

For the history on how Frobenius developed the theory of characters (a pretty convoluted one and hard to fathom from modern accounts) I recommend Representations of Finite Groups: A Hundred Years, Part I by T. Y. Lam.


2 Responses to Symmetric Functions 0

  1. Jake says:

    FYI: Your link is broken. I think you meant:
    I look forward to your future posts!

  2. frvillegas says:

    Thanks Jake. I fixed it. I’m still finding my way arounf here.

Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )


Connecting to %s

%d bloggers like this: