An introduction to categorification, illustrated on the cut and flow lattices of graphs
Event details
| Date | 18.11.2013 |
| Hour | 16:00 › 17:00 |
| Speaker | Zsuzsanna Dancsó (UToronto) |
| Location | |
| Category | Conferences - Seminars |
After a general introduction to categorification, we are going to study an example of combinatorial nature in detail: the categorification of the cut and flow lattices of graphs.
We discuss a simple construction associating a finite dimensional algebra ("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.
We discuss a simple construction associating a finite dimensional algebra ("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.
Practical information
- General public
- Free
Organizer
- Tamas Hausel