NB: A PDF version of this announcement (suitable for posting) is also available.

Combinatorial Rules for Computations in the Symmetric Functions

Michael Zabrocki
York University

Thursday, April 26, 2001
102 Bradley Hall, 4 pm
Tea 3:30 pm, Math Lounge

Abstract: The symmetric functions form a space that is beautiful from many different perspectives: as a Hopf algebra, a polynomial ring, as representations of Gln, etc. Some of the most amazing properties that are associated with this space are the combinatorial rules that arise for doing complex computations. We will present a definition of the symmetric functions and the standard bases followed by several examples of simple rules for doing computations with pictures.

This talk will be accessible to graduate students.