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:20160101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=UTC:20170214T163000
DTEND;TZID=UTC:20170214T173000
DTSTAMP:20211006T222354Z
CREATED:20211006T222354Z
LAST-MODIFIED:20211006T222354Z
UID:20183-1487089800-1487093400@www.ashoka.edu.in
SUMMARY:The Ramsey Theory of Ordinals
DESCRIPTION:Abstract: Ramsey Theory is a branch of mathematics that is oftentimes summed up by the slogan “complete disorder is impossible”. A classical example is a Theorem on Friends and Strangers stating that in every party with six guests there is a group of three people who are either all mutually acquainted or all mutually unacquainted. More abstractly this amounts to asking whether for an edge-coloring of a complete graph there is a homogeneous set of vertices (a set of vertices such that all edges between them get the same color) of a certain size. This problem can be considered both in the finite and infinite. In the infinite\, considering structural aspects as simple as the order can make a difference. We are going to consider these questions for the simplest cases of infinite linearly ordered sets—countable ordinals.
URL:https://www.ashoka.edu.in/event/the-ramsey-theory-of-ordinals/
CATEGORIES:Offline
END:VEVENT
END:VCALENDAR