BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CMSA - ECPv6.15.18//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:20210314T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20211107T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20220313T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20221106T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20230312T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20231105T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20221102T124500
DTEND;TZID=America/New_York:20221102T134500
DTSTAMP:20260409T205834
CREATED:20230817T174336Z
LAST-MODIFIED:20240121T174258Z
UID:10001270-1667393100-1667396700@cmsa.fas.harvard.edu
SUMMARY:Doping and inverting Mott insulators on semiconductor moire superlattices
DESCRIPTION:Speaker: Liang Fu (MIT) \n\n\nTitle: Doping and inverting Mott insulators on semiconductor moire superlattices \nAbstract: Semiconductor bilayer heterostructures provide a remarkable platform for simulating Hubbard models on an emergent lattice defined by moire potential minima. As a hallmark of Hubbard model physics\, the Mott insulator state with local magnetic moments has been observed at half filling of moire band. In this talk\, I will describe new phases of matter that grow out of the canonical 120-degree antiferromagnetic Mott insulator on the triangular lattice. First\, in an intermediate range of magnetic fields\, doping this Mott insulator gives rise to a dilute gas of spin polarons\, which form a pseudogap metal. Second\, the application of an electric field between the two layers can invert the many-body gap of a charge-transfer Mott insulator\, resulting in a continuous phase transition to a quantum anomalous Hall insulator with a chiral spin structure. Experimental results will be discussed and compared with theoretical predictions.
URL:https://cmsa.fas.harvard.edu/event/collquium-11222/
LOCATION:CMSA Room G10\, CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:Colloquium
ATTACH;FMTTYPE=image/png:https://cmsa.fas.harvard.edu/media/CMSA-Colloquium-11.02.22.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20221026T123000
DTEND;TZID=America/New_York:20221026T133000
DTSTAMP:20260409T205834
CREATED:20230817T174027Z
LAST-MODIFIED:20240121T174027Z
UID:10001269-1666787400-1666791000@cmsa.fas.harvard.edu
SUMMARY:Clique listing algorithms
DESCRIPTION:Speaker: Virginia Vassilevska Williams (MIT) \nTitle: Clique listing algorithms \nAbstract: A k-clique in a graph G is a subgraph of G on k vertices in which every pair of vertices is linked by an edge. Cliques are a natural notion of social network cohesiveness with a long history. \nA fundamental question\, with many applications\, is “How fast can one list all k-cliques in a given graph?”. \nEven just detecting whether an n-vertex graph contains a k-Clique has long been known to be NP-complete when k can depend on n (and hence no efficient algorithm is likely to exist for it). If k is a small constant\, such as 3 or 4 (independent of n)\, even the brute-force algorithm runs in polynomial time\, O(n^k)\, and can list all k-cliques in the graph; though O(n^k) time is far from practical. As the number of k-cliques in an n-vertex graph can be Omega(n^k)\, the brute-force algorithm is in some sense optimal\, but only if there are Omega(n^k) k-cliques. In this talk we will show how to list k-cliques faster when the input graph has few k-cliques\, with running times depending on the number of vertices n\, the number of edges m\, the number of k-cliques T and more. We will focus on the case when k=3\, but we will note some extensions. \n(Based on joint work with Andreas Bjorklund\, Rasmus Pagh\, Uri Zwick\, Mina Dalirrooyfard\, Surya Mathialagan and Yinzhan Xu)
URL:https://cmsa.fas.harvard.edu/event/collquium_102722/
LOCATION:CMSA Room G10\, CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:Colloquium
ATTACH;FMTTYPE=image/png:https://cmsa.fas.harvard.edu/media/CMSA-Colloquium-10.26.22.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20221019T123000
DTEND;TZID=America/New_York:20221019T133000
DTSTAMP:20260409T205834
CREATED:20230817T173735Z
LAST-MODIFIED:20240214T113414Z
UID:10001268-1666182600-1666186200@cmsa.fas.harvard.edu
SUMMARY:The Mobility Edge of Lévy Matrices
DESCRIPTION:Colloquium \nSpeaker: Patrick Lopatto (Brown) \nTitle: The Mobility Edge of Lévy Matrices \nAbstract: Lévy matrices are symmetric random matrices whose entry distributions lie in the domain of attraction of an alpha-stable law; such distributions have infinite variance when alpha is less than 2. Due to the ubiquity of heavy-tailed randomness\, these models have been broadly applied in physics\, finance\, and statistics. When the entries have infinite mean\, Lévy matrices are predicted to exhibit a phase transition separating a region of delocalized eigenvectors from one with localized eigenvectors. We will discuss the physical context for this conjecture\, and describe a result establishing it for values of alpha close to zero and one. This is joint work with Amol Aggarwal and Charles Bordenave.
URL:https://cmsa.fas.harvard.edu/event/collquium-101922/
LOCATION:CMSA Room G10\, CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:Colloquium
ATTACH;FMTTYPE=image/png:https://cmsa.fas.harvard.edu/media/CMSA-Colloquium-10.19.22.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20221012T123000
DTEND;TZID=America/New_York:20221012T133000
DTSTAMP:20260409T205834
CREATED:20230817T173346Z
LAST-MODIFIED:20240222T165414Z
UID:10001267-1665577800-1665581400@cmsa.fas.harvard.edu
SUMMARY:Complete disorder is impossible: Some topics in Ramsey theory
DESCRIPTION:Colloquium \nSpeaker: James Cummings\,Carnegie Mellon University \nTitle: Complete disorder is impossible: Some topics in Ramsey theory \nAbstract: The classical infinite Ramsey theorem states that if we colour pairs of natural numbers using two colours\, there is an infinite set all of whose pairs get the same colour. This is the beginning of a rich theory\, which touches on many areas of mathematics including graph theory\, set theory and dynamics. I will give an overview of Ramsey theory\, emphasizing the diverse ideas which are at play in this area.
URL:https://cmsa.fas.harvard.edu/event/collquium-101222/
LOCATION:CMSA Room G10\, CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:Colloquium
ATTACH;FMTTYPE=image/png:https://cmsa.fas.harvard.edu/media/CMSA-Colloquium-10.12.22-1.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20221005T160000
DTEND;TZID=America/New_York:20221005T170000
DTSTAMP:20260409T205834
CREATED:20230817T173038Z
LAST-MODIFIED:20240229T110447Z
UID:10001266-1664985600-1664989200@cmsa.fas.harvard.edu
SUMMARY:Quantum statistical mechanics of charged black holes and strange metals
DESCRIPTION:Colloquium \nPlease note this colloquium will be held at a special time:  4:00-5:00 pm. \nSpeaker: Subir Sachdev (Harvard) \nTitle: Quantum statistical mechanics of charged black holes and strange metals\n\nAbstract: The Sachdev-Ye-Kitaev model was introduced as a toy model of interacting fermions without any particle-like excitations. I will describe how this toy model yields the universal low energy quantum theory of generic charged black holes in asymptotically 3+1 dimensional Minkowski space. I will also discuss how extensions of the SYK model yield a realistic theory of the strange metal phase of correlated electron systems.\n\n\nSlides: cmsa22
URL:https://cmsa.fas.harvard.edu/event/colloquium_10522/
LOCATION:CMSA Room G10\, CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:Colloquium
ATTACH;FMTTYPE=image/png:https://cmsa.fas.harvard.edu/media/CMSA-Colloquium-10.05.22-1.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20220928T123000
DTEND;TZID=America/New_York:20220928T133000
DTSTAMP:20260409T205834
CREATED:20230817T172722Z
LAST-MODIFIED:20240229T110654Z
UID:10001265-1664368200-1664371800@cmsa.fas.harvard.edu
SUMMARY:The Tree Property and uncountable cardinals
DESCRIPTION:Colloquium \nSpeaker: Dima Sinapova (Rutgers University) \nTitle: The Tree Property and uncountable cardinals \nAbstract: In the late 19th century Cantor discovered that there are different levels of infinity. More precisely he showed that there is no bijection between the natural numbers and the real numbers\, meaning that the reals are uncountable. He then went on to discover a whole hierarchy of infinite cardinal numbers. It is natural to ask if finitary and countably infinite combinatorial objects have uncountable analogues. It turns out that the answer is yes. \nWe will focus on one such key combinatorial property\, the tree property. A classical result from graph theory (König’s infinity lemma) shows the existence of this property for countable trees. We will discuss what happens in the case of uncountable trees.\n\n 
URL:https://cmsa.fas.harvard.edu/event/collquium-title-tba-2-2/
LOCATION:CMSA Room G10\, CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:Colloquium
ATTACH;FMTTYPE=image/png:https://cmsa.fas.harvard.edu/media/CMSA-Colloquium-09.28.22.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20220921T123000
DTEND;TZID=America/New_York:20220921T133000
DTSTAMP:20260409T205834
CREATED:20240214T114047Z
LAST-MODIFIED:20240502T145616Z
UID:10002705-1663763400-1663767000@cmsa.fas.harvard.edu
SUMMARY:Moduli spaces of graphs
DESCRIPTION:Colloquium\n\nSpeaker: Melody Chan\, Brown\n\nTitle: Moduli spaces of graphs\n\nAbstract: A metric graph is a graph—a finite network of vertices and edges—together with a prescription of a positive real length on each edge. I’ll use the term “moduli space of graphs” to refer to certain combinatorial spaces—think simplicial complexes—that furnish parameter spaces for metric graphs. There are different flavors of spaces depending on some additional choices of decorations on the graphs\, but roughly\, each cell parametrizes all possible metrizations of a fixed combinatorial graph. Many flavors of these moduli spaces have been in circulation for a while\, starting with the work of Culler-Vogtmann in the 1980s on Outer Space. They have also recently played an important role in some recent advances using tropical geometry to study the topology of moduli spaces of curves and other related spaces. These advances give me an excuse to give what I hope will be an accessible introduction to moduli spaces of graphs and their connections with geometry.
URL:https://cmsa.fas.harvard.edu/event/collquium-92122/
LOCATION:CMSA Room G10\, CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:Colloquium
ATTACH;FMTTYPE=image/png:https://cmsa.fas.harvard.edu/media/CMSA-Colloquium-09.21.22.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20220914T120000
DTEND;TZID=America/New_York:20220914T130000
DTSTAMP:20260409T205834
CREATED:20240214T114614Z
LAST-MODIFIED:20240229T110925Z
UID:10002707-1663156800-1663160400@cmsa.fas.harvard.edu
SUMMARY:Strategyproof-Exposing Mechanisms Descriptions
DESCRIPTION:Colloquium \nSpeaker: Yannai Gonczarowski (Harvard)\n\nTitle: Strategyproof-Exposing Mechanisms Descriptions \nAbstract: One of the crowning achievements of the field of Mechanism Design has been the design and usage of the so-called “Deferred Acceptance” matching algorithm. Designed in 1962 and awarded the Nobel Prize in 2012\, this algorithm has been used around the world in settings ranging from matching students to schools to matching medical doctors to residencies. A hallmark of this algorithm is that unlike many other matching algorithms\, it is “strategy-proof”: participants can never gain by misreporting their preferences (say\, over schools) to the algorithm. Alas\, this property is far from apparent from the algorithm description. Its mathematical proof is so delicate and complex\, that (for example) school districts in which it is implemented do not even attempt to explain to students and parents why this property holds\, but rather resort to an appeal to authority: Nobel laureates have proven this property\, so one should listen to them. Unsurprisingly perhaps\, there is a growing body of evidence that participants in Deferred Acceptance attempt (unsuccessfully) to “game it\,” which results in a suboptimal match for themselves and for others. \nBy developing a novel framework of algorithm description simplicity—grounded at the intersection between Economics and Computer Science—we present a novel\, starkly different\, yet equivalent\, description for the Deferred Acceptance algorithm\, which\, in a precise sense\, makes its strategyproofness far more apparent. Our description does have a downside\, though: some other of its most fundamental properties—for instance\, that no school exceeds its capacity—are far less apparent than from all traditional descriptions of the algorithm. Using the theoretical framework that we develop\, we mathematically address the question of whether and to what extent this downside is unavoidable\, providing a possible explanation for why our description of the algorithm has eluded discovery for over half a century. Indeed\, it seems that in the design of all traditional descriptions of the algorithm\, it was taken for granted that properties such as no capacity getting exceeded should be apparent. Our description emphasizes the property that is important for participants to correctly interact with the algorithm\, at the expense of properties that are mostly of interest to policy makers\, and thus has the potential of vastly improving access to opportunity for many populations. Our theory provides a principled way of recasting algorithm descriptions in a way that makes certain properties of interest easier to explain and grasp\, which we also support with behavioral experiments in the lab. \nJoint work with Ori Heffetz and Clayton Thomas.
URL:https://cmsa.fas.harvard.edu/event/collquium-title-tba/
LOCATION:CMSA Room G10\, CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:Colloquium
ATTACH;FMTTYPE=image/png:https://cmsa.fas.harvard.edu/media/CMSA-Colloquium-09.14.22-1.png
END:VEVENT
END:VCALENDAR