Spring 2023 Math UN3952 Undergraduate Seminars: Symmetric Functions and Macdonald Polynomials

Instructor: Cailan Li
E-mail: ccl2166@columbia.edu
Classes: Thursdays 6:05 PM - 8:05 PM in Math 507
Office hours:Please email me to make an appointment.
I will usually be in my office on Thursdays 5-6 PM if you have any last minute questions/concerns.


Description

The study of symmetric functions has a rich history, dating back to at least the mid-nineteenth century and remains an active field of research today. In part this is because it provides a tool to investigate various phenomenon occuring in representation theory and algebraic geometry. To provide a quick definition, a symmetric function (or rather polynomial in this case) on n variables x1, ... , xn is a polynomial that is unchanged by any permutation of its n variables. Because of this symmetry, it turns out symmetric functions (polynomials) have remarkable algebraic properties, much of which can be expressed using the language of combinatorics. A large portion of the seminar will be about investigating these properties and the combinatorics that arises.

dummies

In the later half of the seminar we will go over Macdonald polynomials, the final boss of symmetric functions, in great detail. Since their introduction, Macdonald polynomials have been intensely studied and have found applications in special function theory, representation theory, algebraic geometry, group theory, statistics, and quantum mechanics. It is unlikely we will actually cover all these applications, but perhaps we will see a few.

An (almost) complete outline of the semester with references, can be found in the Seminar Outline. Please skim the relevant sections of the references to see if the topic is something you want to present.

Prerequisites

The formal requirements will be MATH UN2010: Linear Algebra and one course demonstrating mathematical maturity such as MATH UN2000: Intro to Higher Mathematics. MATH BC2006: Combinatorics might be useful for familiarity with some topics and MATH GU4044: Representations of Finite Groups might be useful as motivation but both aren't strict requirements.

Grading

Grading will be based on participation, attendance, and effort. Specifically,

Attendance:

Effort:

Expectations

Audience members are expected to actively engaged during the talk. In particular I want to emphasize that if you are confused or need an additional explanation at any point during a talk, PLEASE ASK A QUESTION . There will be no dumb questions in this seminar, so please feel free to ask anything you want (pertaining to the lecture).

Speakers are expected to put effort into making their lecture as clear, cohesive and engaging as possible. In particular, please put in more effort than just copying what is written in the references on the blackboard. There should be a logical flow to your talk and you should explain how the different things you are writing down relate to each other. Here are some guidelines/suggestions for your talk

We will need to meet once before your talk (typically on Tuesday on Zoom). I expect that 80% of your notes should be typed up by then. We will meet once again after your talk (directly after, in my office) where I will give you feedback on the talk.

Main References

An Introduction to Symmetric Functions and their Combinatorics
Algebraic Combinatorics and Coinvariant Spaces

Seminar Schedule

Dates Speaker Topic Supplementary Images
2/2 Cailan Li Linear Algebra Review: Notes
2/16 Aaron Cohen Generating Functions: Notes
2/16 Tuan Dolmen Monomial and Elementary Symmetric Functions: Notes
2/23 Hugo Hamilton Complete Homogeneous and Power Sum Symmetric Functions: Notes
2/23 Noah Bergam q−analogs: Notes
3/2 Doran Sekaran Stirling Numbers and Evaluation of Symmetric Functions: Notes
3/2 Max Ozerov Schur Polynomials: Notes
3/9 Cailan Li Review+Supplements: Notes
3/23 Caitlin Kim Jacobi-Trudi Identities: Notes
3/23 John Blackwelder The Robinson-Schensted (RS) Algorithm: Notes
3/30 Gilad Kestenberg The Hall Inner Product: Notes
3/30 Alexander Lindenbaum The Robinson-Schensted-Knuth (RSK) Algorithm and Cauchy's Formula: Notes
4/6 Yaashna Punia Pieri and Murnaghan-Nakayama Rules: Notes
4/6 Param Gujral The Hook-Content and Hook-length Formula: Notes
4/13 Aryaman Himatsingka Plane Partitions: Notes Pic 1, Pic 2
4/13 Jacob Daum HyperGeometric Series: Notes
4/20 Noah Bergam q−Hypergeometric Series: Notes
4/20 Tuan Dolmen The Original Macdonald Polynomials