Seminar Event Detail


Combinatorics

Date:  Friday, April 01, 2016
Location:  4088 East Hall (3:10 PM to 4:00 PM)

Title:  Kasteleyn's method and positroids

Abstract:   In 1967, Kasteleyn gave a way to count perfect matchings of a planar graph by computing determinants. We'll give a quick proof of Kasteleyn's result, and will then explain Postnikov's parametrization of positroid varieties. This talk will be mostly exposition of other people's work, but I like to think that I've cleaned up the exposition a bit.

Files:


Speaker:  David Speyer
Institution:  U Michigan

Event Organizer:     

 

Edit this event (login required).
Add new event (login required).
For access requests and instructions, contact math-webmaster@umich.edu

Back to previous page
Back to UM Math seminars/events page.