BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:KLRW algebras of finite type - Andrew Mathas (University of Sydney
 )
DTSTART:20250716T100000Z
DTEND:20250716T110000Z
UID:TALK234004@talks.cam.ac.uk
DESCRIPTION:The KLRW algebras are a generalisation of the Khovanov&ndash\;
 Lauda&ndash\;Rouquier algebras\, which were introducedby Webster. These al
 gebras are defined diagrammatically\, and they are somewhat scary algebras
  as theyhave red strings and ghost strings. As with the KLR algebras\, the
  KLRW algebras categorify the highest weightmodules of the corresponding q
 uantum group. In particular\, this implies that the simple modules of thes
 ealgebras are indexed by the vertices of the corresponding crystal graphs.
  I will describe how to constructbases of the KLRW algebras using paths fr
 om the crystal graphs.\nThis is joint work with Dani Tubbenhauer
LOCATION:External
END:VEVENT
END:VCALENDAR