BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Ashoka University - ECPv6.18.2//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Ashoka University
X-ORIGINAL-URL:https://www.ashoka.edu.in
X-WR-CALDESC:Events for Ashoka University
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:UTC
BEGIN:STANDARD
TZOFFSETFROM:+0000
TZOFFSETTO:+0000
TZNAME:UTC
DTSTART:20150101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=UTC:20161027T163000
DTEND;TZID=UTC:20161027T173000
DTSTAMP:20211006T223253Z
CREATED:20211006T223253Z
LAST-MODIFIED:20211006T223253Z
UID:20195-1477585800-1477589400@www.ashoka.edu.in
SUMMARY:Countable Approximation in Mathematics
DESCRIPTION:Abstract: Throughout mathematics\, separability-type conditions are convenient hypotheses. In my talk\, I will address the common practice of approximating complicated objects with “countably generated” ones. I will show how such approximations are useful in topology and coarse geometry and proceed to give a rough outline of how I am using these methods in my research concerning the representation theory of groupoids.
URL:https://www.ashoka.edu.in/event/countable-approximation-in-mathematics/
CATEGORIES:Offline
END:VEVENT
END:VCALENDAR