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: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
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20190310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20191103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20180205T090000
DTEND;TZID=America/New_York:20180209T170000
DTSTAMP:20250304T211916Z
CREATED:20230717T174149Z
LAST-MODIFIED:20250304T211916Z
UID:10000044-1517821200-1518195600@cmsa.fas.harvard.edu
SUMMARY:Workshop on Probabilistic and Extremal Combinatorics
DESCRIPTION:The workshop on Probabilistic and Extremal Combinatorics will take place February 5-9\, 2018 at the Center of Mathematical Sciences and Applications\, located at 20 Garden Street\, Cambridge\, MA. \nExtremal and Probabilistic Combinatorics are two of the most central branches of modern combinatorial theory. Extremal Combinatorics deals with problems of determining or estimating the maximum or minimum possible cardinality of a collection of finite objects satisfying certain requirements. Such problems are often related to other areas including Computer Science\, Information Theory\, Number Theory and Geometry. This branch of Combinatorics has developed spectacularly over the last few decades. Probabilistic Combinatorics can be described informally as a (very successful) hybrid between Combinatorics and Probability\, whose main object of study is probability distributions on discrete structures. \nThere are many points of interaction between these fields. There are deep similarities in methodology. Both subjects are mostly asymptotic in nature. Quite a few important results from Extremal Combinatorics have been proven applying probabilistic methods\, and vice versa. Such emerging subjects as Extremal Problems in Random Graphs or the theory of graph limits stand explicitly at the intersection of the two fields and indicate their natural symbiosis. \nThe symposia will focus on the interactions between the above areas. These topics include Extremal Problems for Graphs and Set Systems\, Ramsey Theory\, Combinatorial Number Theory\, Combinatorial Geometry\, Random Graphs\, Probabilistic Methods and Graph Limits. \nParticipation: The workshop is open to participation by all interested researchers\, subject to capacity. \nConfirmed participants include: \n\nJozsef Balogh\, University of Illinois\, Urbana\nFan Chung (Graham)\, University of California\, San Diego\nAsaf Ferber\, Massachusetts Institute of Technology\nJacob Fox\, Stanford Unviersity\nDavid Gamarnik\, Massachusetts Institute of Technology\nPenny Haxell\, University of Waterloo\nHao Huang\, Emory University\nJeff Kahn\, Rutgers University\nPeter Keevash\, Oxford University\nMichael Krivelevich\, Tel Aviv University\nDaniela Kühn\, University of Birmingham\nShoham Letzer\, ITS Zürich\nShachar Lovett\, University of California\, San Diego\nEyal Lubetzky\, Courant Institute\nRob Morris\, IMPA\nBhargav Narayanan\, Rutgers University\nDeryk Osthus\, University of Birmingham\nJanos Pach\, NYU\nYuval Peres\, Microsoft Redmond\nAlexey Pokryovskyi\, ETH Zürich\nWojciech Samotij\, Tel Aviv University\nLisa Sauermann\, Stanford University\nMathias Schacht\, University of Hamburg\nAlexander Scott\, University of Oxford\nAsaf Shapira\, Tel Aviv University\nJozef Skokan\, London School of Economics\nJoel Spencer\, New York University\nAngelika Steger\, ETH Zurich\nJacques Verstraete\, University of California\, San Diego\nYufei Zhao\, Massachusetts Institute of Technology\nDavid Zuckerman\, University of Texas at Austin\n\nCo-organizers of this workshop include Benny Sudakov and David Conlon.  More details about this event\, including participants\, will be updated soon.
URL:https://cmsa.fas.harvard.edu/event/workshop-on-probabilistic-and-extremal-combinatorics/
LOCATION:CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:Event,Workshop
END:VEVENT
END:VCALENDAR