BEGIN:VCALENDAR
PRODID:-//Compnay Inc//Product Application//EN
VERSION:2.0
METHOD:PUBLISH
BEGIN:VEVENT
DTSTART:20261014T123000Z
DTEND:20261014T133000Z
DTSTAMP:20261012T002452Z
UID:e4085ba5-25af-40dd-b6e9-55488ce66b69
CREATED:20261008T043333Z
X-ALT-DESC;FMTTYPE=text/html:Castle.Proxies.LanguageContentMapProxy
DESCRIPTION:Abstract 
This talk shows, on screen, two families of results in computational topology from about fifteen years ago, one with Tamal Dey and Bala Krishnamoorthy and the other with Nathan Dunfield. The first problem is finding the shortest cycle in a given homology class on a surface or a solid. It turns out to be solvable by linear programming, for a reason that is pleasant to explain. The second problem is finding the least area surface spanning a knot, the soap film the knot would hold i...
LAST-MODIFIED:20261012T002452Z
LOCATION:Madhava Hall, Main Building, 3rd Floor, Math Department ...
SEQUENCE:0
STATUS:CONFIRMED
SUMMARY:Knots and Optimal Cycles and Thoughts on AI+Mathematics+Coding
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR