University of Cambridge > Talks.cam > Junior Geometry Seminar > The Alexander polynomial as a Reshetikhin-Turaev invariant

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

The Alexander polynomial as a Reshetikhin-Turaev invariant

Download to your calendar using vCal

  • UserJonathan Grant (Durham)
  • ClockFriday 06 March 2015, 15:00-16:00
  • HouseMR13.

If you have a question about this talk, please contact Joe Waldron .

The Alexander polynomial is a classical invariant of knots introduced in the 1920’s with clear connections to the topology of knots and surfaces. The Reshetikhin-Turaev invariants are much more recent, and are in general much more poorly understood. These often arise from the representation theory of quantum groups. I will show how the Alexander polynomial can be interpreted as a Reshetikhin-Turaev invariant using representations of U_q(gl(1|1)), and show how this can be used to understand a category of representations of U_q(gl(1|1)). Finally, I will explain how this relates to the theory of highest weight modules of U_q(gl(m)), and can be categorified using projective modules over cyclotomic KLR algebras, and how the theory of foams for sl_n knot homology fit into this picture.

This talk is part of the Junior Geometry Seminar series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Inference Group Seminar Room FG5, level 5 in the F & G wards, Addenbrooke's Hospital Seminar Room (Level 2), Dept of Pharmacology .

Other talks

Christmas Social Evening & Annual General Meeting Cambridge AI in Medicine Seminar - April 2026 Together Now: Cooperation and Collaboration in Social Art Practice Title to be confirmed Online Causal Inference Seminar title and abstract tba (joint seminar with Spectral Geometry in the Clouds)
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity