BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Utah Math Department//Minimal free resolutions of toppling ideals//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Minimal free resolutions of toppling ideals
X-WR-CALDESC:Minimal free resolutions of toppling ideals at University of Utah Mathematics Department
X-WR-TIMEZONE:America/Denver
BEGIN:VEVENT
UID:20150116T151000-madhusudan-manjunath@math.utah.edu
DTSTART;TZID=America/Denver:20150116T151000
DTEND;TZID=America/Denver:20150116T161000
DTSTAMP:20260916T140625Z
SUMMARY:Minimal free resolutions of toppling ideals
DESCRIPTION:Speaker: Madhusudan Manjunath\, UC Berkeley\n\nThe Laplacian lattice of an undirected connected graph is the lattice generated by the rows of its Laplacian matrix. We describe the minimal free resolution of the Laplacian lattice ideal of the graph. This is joint work with Frank-Olaf Schreyer and John Wilmes. 

LOCATION:LCB 222

URL:http://math.utah.edu/caseminar/2015-01-16-madhusudan-manjunath/
END:VEVENT
END:VCALENDAR