BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:An introduction to categorification\, illustrated on the cut and f
 low lattices of graphs
DTSTART:20131118T160000
DTEND:20131118T170000
DTSTAMP:20260407T104210Z
UID:641e67c3bf96b1314c95dcc8e2bd4981baf117c1432d9b5128be0a5e
CATEGORIES:Conferences - Seminars
DESCRIPTION:Zsuzsanna Dancsó (UToronto)\nAfter a general introduction to
  categorification\, we are going to study an example of combinatorial nat
 ure in detail: the categorification of the cut and flow lattices of graph
 s.\nWe discuss a simple construction associating a finite dimensional alge
 bra ("bipartite algebra") to a graph\, and explain how the study of the 
 representation theory of these algebras produces a categorification of the
  cut and flow lattices of graphs. I'll also mention why we suspect that 
 bipartite algebras should arise naturally in several other contexts. This
  is joint work with Anthony Licata.
LOCATION:MA A110 http://plan.epfl.ch/?lang=fr&room=MA+110
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR