BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CMSA - ECPv6.17.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:CMSA
X-ORIGINAL-URL:https://cmsa.fas.harvard.edu
X-WR-CALDESC:Events for CMSA
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20160313T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20161106T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20170312T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20171105T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20180311T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20181104T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20170215T150000
DTEND;TZID=America/New_York:20171214T160000
DTSTAMP:20240124T065049Z
CREATED:20240124T064532Z
LAST-MODIFIED:20240124T065049Z
UID:10001332-1487170800-1513267200@cmsa.fas.harvard.edu
SUMMARY:Random Matrix & Probability Theory Seminar (2016-2017)
DESCRIPTION:The random matrix and probability theory will be every Wednesday from 3pm-4pm in CMSA Building\, 20 Garden Street\, Room G10.
URL:https://cmsa.fas.harvard.edu/event/random-matrix-probability-theory-seminar-2016-2017/
LOCATION:CMSA Room G10\, CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:Random Matrix & Probability Theory Seminar
ATTACH;FMTTYPE=image/jpeg:https://cmsa.fas.harvard.edu/media/DSC_0025-768x512-1.jpg
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20170907T170000
DTEND;TZID=America/New_York:20170907T180000
DTSTAMP:20250305T183135Z
CREATED:20230717T172748Z
LAST-MODIFIED:20250305T183135Z
UID:10000035-1504803600-1504807200@cmsa.fas.harvard.edu
SUMMARY:Noga Alon Public Talk
DESCRIPTION:Noga Alon (Tel Aviv University) will be giving a public talk on September 7\, 2017\,as part of the program on combinatorics and complexity hosted by the CMSA during AY17-18.  The talk will be at 5:00pm in Askwith Hall\, 13 Appian Way\, Cambridge\, MA. \nTitle: Graph Coloring: Local and Global \nAbstract: Graph Coloring is arguably the most popular subject in Discrete Mathematics\, and its combinatorial\, algorithmic and computational aspects have been studied intensively. The most basic notion in the area\, the chromatic number of a graph\, is an inherently global property. This is demonstrated by the hardness of computation or approximation of this invariant as well as by the existence of graphs with arbitrarily high chromatic number and no short cycles. The investigation of these graphs had a profound impact on Graph Theory and Combinatorics. It combines combinatorial\, probabilistic\, algebraic and topological techniques with number theoretic tools. I will describe the rich history of the subject focusing on some recent results. \n 
URL:https://cmsa.fas.harvard.edu/event/noga-alon-public-talk-9-7-17/
LOCATION:MA
CATEGORIES:Event,Public Lecture
ATTACH;FMTTYPE=image/png:https://cmsa.fas.harvard.edu/media/Noga-Poster-2-1.png
END:VEVENT
END:VCALENDAR