BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CMSA - ECPv6.15.20//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:20230312T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20231105T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20240310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20241103T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20250309T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20251102T060000
END:STANDARD
END:VTIMEZONE
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
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20240310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20241103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20240318T163000
DTEND;TZID=America/New_York:20240318T173000
DTSTAMP:20260510T182058
CREATED:20240130T151005Z
LAST-MODIFIED:20240308T200603Z
UID:10000812-1710779400-1710783000@cmsa.fas.harvard.edu
SUMMARY:Koszul duality & twisted holography for asymptotically flat spacetimes
DESCRIPTION:Colloquium \nSpeaker: Natalie Paquette\, University of Washington \nTitle: Koszul duality & twisted holography for asymptotically flat spacetimes \nAbstract: Koszul duality has been understood in recent years to characterize order-type defects in twists of supersymmetric field theories. This notion has been generalized\, from a physical point of view\, by studying couplings between D-branes and closed string theories in the topological string. Computing the D-brane backreaction\, and studying the resulting open/closed string duality\, is the purview of the twisted holography program. Twisted holography seeks to study supersymmetric sectors of the AdS/CFT correspondence using these methods\, and leverage the appropriate generalization of Koszul duality to elucidate the bulk/boundary map. When applying these methods to a topological string configuration on twistor space\, one can construct an instance of twisted holography in which a 2d chiral algebra\, supported on the “celestial sphere”\, is dual to a 4d theory in an asymptotically flat spacetime. This is the first such top-down example of holography in a 4d asymptotically flat spacetime. This talk describes joint work done\, variously\, with Kevin Costello\, Brian Williams\, and Atul Sharma.
URL:https://cmsa.fas.harvard.edu/event/colloquium-31824/
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-03.18.2024.docx-2_Page_1.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20240304T163000
DTEND;TZID=America/New_York:20240304T173000
DTSTAMP:20260510T182058
CREATED:20240130T150912Z
LAST-MODIFIED:20240228T213450Z
UID:10000810-1709569800-1709573400@cmsa.fas.harvard.edu
SUMMARY:Strong bounds for arithmetic progressions
DESCRIPTION:Colloquium \nSpeaker: Raghu Meka (UCLA) \nTitle: Strong bounds for arithmetic progressions \nAbstract: Suppose you have a set S of integers from {1\,2\,…\,N} that contains at least N / C elements. Then for large enough N\, must S contain three equally spaced numbers (i.e.\, a 3-term arithmetic progression)? \nIn 1953\, Roth showed this is the case when C is roughly (log log N). Behrend in 1946 showed that C can be at most exp(sqrt(log N)). Since then\, the problem has been a cornerstone of the area of additive combinatorics. Following a series of remarkable results\, a celebrated paper from 2020 due to Bloom and Sisask improved the lower bound on C to C = (log N)^(1+c) for some constant c > 0. \nThis talk will describe a new work showing that C can be much closer to Behrend’s construction. Based on joint work with Zander Kelley.
URL:https://cmsa.fas.harvard.edu/event/colloquium-3424/
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-03.04.2024-1.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20240226T163000
DTEND;TZID=America/New_York:20240226T173000
DTSTAMP:20260510T182058
CREATED:20240130T150524Z
LAST-MODIFIED:20240220T171315Z
UID:10000809-1708965000-1708968600@cmsa.fas.harvard.edu
SUMMARY:Factorization algebras in quite a lot of generality
DESCRIPTION:Colloquium \nSpeaker: Clark Barwick\, University of Edinburgh \nTitle: Factorization algebras in quite a lot of generality \nAbstract: The objects of arithmetic geometry are not manifolds. Some concepts from differential geometry admit analogues in arithmetic\, but they are not straightforward. How then can we hope to make precise sense of quantum field theories on these objects? I will propose the beginnings of a mathematical framework via a general theory of factorization algebras. A new feature is a subtle piece of additional structure on our objects – what I call a world-structure – that is ordinarily left implicit.
URL:https://cmsa.fas.harvard.edu/event/colloquium-22624/
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-02.26.2024.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20240212T163000
DTEND;TZID=America/New_York:20240212T173000
DTSTAMP:20260510T182058
CREATED:20240201T145702Z
LAST-MODIFIED:20240209T210827Z
UID:10000807-1707755400-1707759000@cmsa.fas.harvard.edu
SUMMARY:Machine Learning and Scientific Computing: There is plenty of room in the middle
DESCRIPTION:Colloquium \nSpeaker: Petros Koumoutsakos\, Harvard SEAS \nTitle: Machine Learning and Scientific Computing: There is plenty of room in the middle \nAbstract: Over the last thirty years we have experienced more than a billion-fold increase in hardware capabilities and a dizzying pace of acquiring and transmitting massive amounts of data. Scientific Computing and\, more lately\, Artificial Intelligence (AI) has been key beneficiaries of these advances. In this talk I would outline the need for bridging the decades long advances in Scientific Computing with those of AI. I will use examples from fluid mechanics to argue for forming alloys of AI and simulations for their prediction and control. I will present novel algorithms for learning the Effective Dynamics (LED) of complex systems and a fusion of multi- agent reinforcement learning and scientific computing (SciMARL) for modeling and control of turbulent flows. I will also show our recent work on Optimizing a Discrete Loss (ODIL) that outperforms popular techniques such as PINNs by several orders of magnitude. \nI will juxtapose successes and failures and argue that the proper fusion of scientific computing and AI expertise are essential to advance scientific frontiers. \n 
URL:https://cmsa.fas.harvard.edu/event/colloquium-21224/
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-02.12.2024_Page_1.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20231211T163000
DTEND;TZID=America/New_York:20231211T173000
DTSTAMP:20260510T182058
CREATED:20240223T074431Z
LAST-MODIFIED:20240223T074431Z
UID:10002828-1702312200-1702315800@cmsa.fas.harvard.edu
SUMMARY:Homology\, higher derived limits\, and set theory
DESCRIPTION:Colloquium \nSpeaker: Justin Moore (Cornell University) \nTitle: Homology\, higher derived limits\, and set theory \nAbstract: Singular homology has a number of well-known defects when used to study spaces such as the Hawaiian earring and solenoids. It may not reflect the “shape” of the space and can give counterintuitive information about its dimension. One remedy of this is to develop a homology theory based on approximating spaces by polyhedra\, computing their homologies\, and then taking a limit. This is the approach taken by Steenrod-Sitnikov homology and Lisica and Mardesic’s strong homology. Even within the class of locally compact second countable spaces though\, the properties of these homology theories — and the higher derived limits which underly them — are dependent on axioms of set theory beyond ZFC. Recently it was shown that it is consistent with (and therefore independent of) ZFC that strong homology and Steenrod Sitnikov homology coincide in the class of locally compact second countable spaces — and therefore each of these homology theories enjoys the desirable properties of the other. These results also point to how we might develop variants of these homology theories which enjoy their desirable properties\, but which are less sensitive to set theory. This is joint work with Nathaniel Bannister\, Jeff Bergfalk\, and Stevo Todorcevic.
URL:https://cmsa.fas.harvard.edu/event/colloquium-121123/
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-12.11.2023.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20231204T163000
DTEND;TZID=America/New_York:20231204T173000
DTSTAMP:20260510T182058
CREATED:20240223T075301Z
LAST-MODIFIED:20240223T075301Z
UID:10002830-1701707400-1701711000@cmsa.fas.harvard.edu
SUMMARY:Analysis of ALH* gravitational instantons
DESCRIPTION:Speaker: Xuwen Zhu (Northeastern) \nTitle: Analysis of ALH* gravitational instantons \nAbstract: Gravitational instantons are non-compact Calabi-Yau metrics with L^2 bounded curvature and are categorized into six types. We will discuss one such type called ALH* metrics which has a non-compact end modelled by the Calabi ansatz with inhomogeneous collapsing near infinity. Such metrics appeared recently in the works on SYZ conjecture\, as well as the scaling bubble limits for codimension-3 collapsing of K3 surfaces\, where the study of its Laplacian played a central role. In this talk I will talk about the Fredholm mapping property and L^2 cohomology of such metrics. This is ongoing work joint with Rafe Mazzeo.
URL:https://cmsa.fas.harvard.edu/event/colloquium-12423/
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-12.04.2023.docx-1.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20231127T163000
DTEND;TZID=America/New_York:20231127T173000
DTSTAMP:20260510T182058
CREATED:20240223T080018Z
LAST-MODIFIED:20240223T080018Z
UID:10002831-1701102600-1701106200@cmsa.fas.harvard.edu
SUMMARY:What do topological dynamics\, combinatorics\, and model theory have in common?
DESCRIPTION:Speaker: Dana Bartosova (University of Florida) \nTitle: What do topological dynamics\, combinatorics\, and model theory have in common? \nAbstract: A striking correspondence between dynamics of automorphism groups of countable first order structures and Ramsey theory of finitary approximation of the structures was established in 2005 by Kechris\, Pestov\, and Todocevic. Since then\, their work has been generalized and applied in many directions. It also struck a fresh wave of interest in finite Ramsey theory.  Many classes of finite structures are shown to have the Ramsey property by encoding their problem in a known Ramsey class and translating a solution back. This is often a case-by-case approach and naturally there is a great need for abstracting the process. There has been much success on this front\, however\, none of the tools captures every situation. We will discuss one such encoding via a model-theoretic notion of semi-retraction introduced by Lynn Scow in 2012. In a joint work\, we showed that a semi-retraction transfers the Ramsey property from one class of structures to another under quite general conditions. We compare semi-retractions to a category-theoretical notion of pre-adjunction revived by Mašulović in 2016. If time permits\, I will mention a transfer theorem of the Ramsey property from a class of finite structures to their uncountable ultraproducts\, which is an AIMSQuaRE project with Džamonja\, Patel\, and Scow.
URL:https://cmsa.fas.harvard.edu/event/colloquium-112723/
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.27.2023_Page_1.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20231120T163000
DTEND;TZID=America/New_York:20231120T173000
DTSTAMP:20260510T182058
CREATED:20240223T080617Z
LAST-MODIFIED:20240223T080617Z
UID:10002833-1700497800-1700501400@cmsa.fas.harvard.edu
SUMMARY:The analytical challenges of connectomics
DESCRIPTION:Speaker: Jeff W. Lichtman (Harvard University) \nTitle: The analytical challenges of connectomics \nAbstract: Recent progress in generating synapse-level maps of brains\, a field known as connectomics\, brings both opportunities and challenges. The upside is that the biophysical instantiation of memories\, behaviors\, and knowledge will soon be before us. The downside is that no one knows exactly how to make sense of this data. I will show what connectomics data sets are and attempt to explain why it is so difficult to unravel their meaning.
URL:https://cmsa.fas.harvard.edu/event/colloquium-112023/
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.20.2023.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20231113T163000
DTEND;TZID=America/New_York:20231113T173000
DTSTAMP:20260510T182058
CREATED:20240223T081522Z
LAST-MODIFIED:20240223T081522Z
UID:10002834-1699893000-1699896600@cmsa.fas.harvard.edu
SUMMARY:Koszul duality in QFT
DESCRIPTION:Speaker: Brian Williams (Boston University) \nTitle: Koszul duality in QFT \nAbstract: We will describe appearances of the algebraic phenomena of Koszul duality in the context of boundary conditions and defects in quantum field theory. Primarily motivated by topological string theory\, this point of view was pioneered by Costello and Li in their proposal for a twisted version of the AdS/CFT correspondence. Since then\, many important examples of (twisted) holographic dualities in string and M-theory have been studied in work of Costello\, Gaiotto\, Paquette and many others. I will survey some of these examples and some current work with Raghavendran and Saberi which uses this formalism to predict exceptional symmetries present in M-theory. \n 
URL:https://cmsa.fas.harvard.edu/event/colloquium-111323/
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.13.2023.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20231106T163000
DTEND;TZID=America/New_York:20231106T173000
DTSTAMP:20260510T182058
CREATED:20240223T083208Z
LAST-MODIFIED:20240223T083208Z
UID:10002838-1699288200-1699291800@cmsa.fas.harvard.edu
SUMMARY:Impossibility results in classical dynamical systems
DESCRIPTION:Speaker: Matthew Foreman (UC Irvine) \nTitle: Impossibility results in classical dynamical systems \nAbstract: In 1932\, motivated by questions in statistical and celestial mechanics\, von Neumann proposed classifying the statistical behavior of dynamical systems. In the 1960’s\, motivated by work of Poincaré\, Smale proposed classifying the qualitative behavior of dynamical systems.  These questions laid the groundwork for enormous amounts of work\, but the fundamental questions remain open. This talk shows that they are impossible to answer in a rigorous sense. The talk will discuss various kinds of impossibility results and describe how they apply to von Neumann’s program and Smale’s program. \n 
URL:https://cmsa.fas.harvard.edu/event/colloquium-11623/
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.06.2023.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20231030T163000
DTEND;TZID=America/New_York:20231030T173000
DTSTAMP:20260510T182058
CREATED:20240223T084547Z
LAST-MODIFIED:20240223T084547Z
UID:10002840-1698683400-1698687000@cmsa.fas.harvard.edu
SUMMARY:Homotopy categories of rings: some properties and consequences in module categories
DESCRIPTION:Speaker: Manuel Cortés-Izurdiaga (University of Malaga) \nTitle:  Homotopy categories of rings: some properties and consequences in module categories \nAbstract: Given a non-necessarily commutative ring with unit and an additive subcategory of the category of right modules\, one can consider complexes of modules in the subcategory and the corresponding homotopy category. Sometimes\, these homotopy categories are the first step in studying other (algebraic) homotopy categories\, such as those associated to a scheme. To study these categories\, one can use results from the category of modules or the category of complexes. In the first part of the talk\, we will see how some results of homotopy categories of complexes extend to homotopy categories of N-complexes\, for a natural number N greater than or equal to 2\, using some techniques from module categories\, such us the deconstruction of a class of modules. \nAnother approximation is to use other methods for studying homotopy categories\, like those coming from triangulated categories. In some cases\, the results obtained in homotopy categories imply some consequences in the category of modules. In the second part of the talk\, we will see how to prove the existence of Gorenstein-projective precovers for some specific rings using this approach.
URL:https://cmsa.fas.harvard.edu/event/colloquium-103023/
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.30.2023.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20231023T163000
DTEND;TZID=America/New_York:20231023T173000
DTSTAMP:20260510T182058
CREATED:20240223T092904Z
LAST-MODIFIED:20240223T092904Z
UID:10002843-1698078600-1698082200@cmsa.fas.harvard.edu
SUMMARY: On Provable Copyright Protection for Generative Model
DESCRIPTION:Speaker: Boaz Barak (Harvard) \nTitle: On Provable Copyright Protection for Generative Model \nAbstract: There is a growing concern that learned conditional generative models may output samples that are substantially similar to some copyrighted data C that was in their training set. We give a formal definition of near access-freeness (NAF) and prove bounds on the probability that a model satisfying this definition outputs a sample similar to C\, even if C is included in its training set. \nRoughly speaking\, a generative model p is k-NAF if for every potentially copyrighted data C\, the output of p diverges by at most k-bits from the output of a model q that did not access C at all. We also give generative model learning algorithms\, which efficiently modify the original generative model learning algorithm in a black box manner\, that output generative models with strong bounds on the probability of sampling protected content. Furthermore\, we provide promising experiments for both language (transformers) and image (diffusion) generative models\, showing minimal degradation in output quality while ensuring strong protections against sampling protected content. \nJoint work with Nikhil Vyas and Sham Kakade. Paper appeared in ICML 2023 and is on https://arxiv.org/abs/2302.10870
URL:https://cmsa.fas.harvard.edu/event/colloquium-102323/
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.23.2023.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20231016T163000
DTEND;TZID=America/New_York:20231016T173000
DTSTAMP:20260510T182058
CREATED:20240223T093426Z
LAST-MODIFIED:20251026T063911Z
UID:10002844-1697473800-1697477400@cmsa.fas.harvard.edu
SUMMARY:An exploration of infinite games—infinite Wordle and the Mastermind numbers
DESCRIPTION:Speaker: Joel D. Hamkins (Notre Dame and Oxford) \nTitle: An exploration of infinite games—infinite Wordle and the Mastermind numbers \nAbstract: Let us explore the nature of strategic reasoning in infinite games\, focusing on the cases of infinite Wordle and infinite Mastermind. The familiar game of Wordle extends naturally to longer words or even infinite words in an idealized language\, and Mastermind similarly has natural infinitary analogues. What is the nature of play in these infinite games? Can the codebreaker play so as to win always at a finite stage of play? The analysis emerges gradually\, and in the talk I shall begin slowly with some easy elementary observations. By the end\, however\, we shall engage with sophisticated ideas in descriptive set theory\, a kind of infinitary information theory. Some assertions about the minimal size of winning sets of guesses\, for example\, turn out to be independent of the Zermelo-Fraenkel ZFC axioms of set theory. Some questions remain open.
URL:https://cmsa.fas.harvard.edu/event/colloquium-101623/
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.16.2023.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20231002T163000
DTEND;TZID=America/New_York:20231002T173000
DTSTAMP:20260510T182058
CREATED:20240227T095159Z
LAST-MODIFIED:20240227T095159Z
UID:10002874-1696264200-1696267800@cmsa.fas.harvard.edu
SUMMARY:Gravitational Instantons
DESCRIPTION:Speaker: Yu-Shen Lin (Boston University) \nTitle: Gravitational Instantons \nAbstract: Gravitational instantons were introduced by Hawking as building blocks of his Euclidean quantum gravity theory back in the 1970s. These are non-compact Calabi-Yau surfaces with L2 curvature and thus can be viewed as the non-compact analogue of K3 surfaces. K3 surfaces are 2-dimensional Calabi-Yau manifolds and are usually the testing stone before conquering the general Calabi-Yau problems. The moduli space of K3 surfaces and its compactification on their own form important problems in various branches in geometry. In this talk\, we will discuss the Torelli theorem of gravitational instantons\, how the cohomological invariants of a gravitational instanton determine them. As a consequence\, this leads to a description of the moduli space of gravitational instantons.
URL:https://cmsa.fas.harvard.edu/event/colloquium-10223/
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.02.2023.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20230503T123000
DTEND;TZID=America/New_York:20230503T133000
DTSTAMP:20260510T182058
CREATED:20230817T183740Z
LAST-MODIFIED:20240216T085646Z
UID:10001284-1683117000-1683120600@cmsa.fas.harvard.edu
SUMMARY:Generative Adversarial Networks (GANs): An Analytical Perspective
DESCRIPTION:Speaker: Xin Guo\, UC Berkeley \nTitle: Generative Adversarial Networks (GANs): An Analytical Perspective \nAbstract: Generative models have attracted intense interests recently. In this talk\, I will discuss one class of generative models\, Generative Adversarial Networks (GANs).  I will first provide a gentle review of the mathematical framework behind GANs. I will then proceed to discuss a few challenges in GANs training from an analytical perspective. I will finally report some recent progress for GANs training in terms of its stability and convergence analysis. \n 
URL:https://cmsa.fas.harvard.edu/event/collquium-5323/
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-05.03.2023.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20230426T123000
DTEND;TZID=America/New_York:20230426T133000
DTSTAMP:20260510T182058
CREATED:20230817T183259Z
LAST-MODIFIED:20240122T053311Z
UID:10001283-1682512200-1682515800@cmsa.fas.harvard.edu
SUMMARY:Boundary behavior at classical and quantum phase transitions
DESCRIPTION:Speaker: Max Metlitski (MIT) \nTitle: Boundary behavior at classical and quantum phase transitions \nAbstract: There has been a lot of recent interest in the boundary behavior of materials. This interest is driven in part by the field of topological states of quantum matter\, where exotic protected boundary states are ubiquitous. In this talk\, I’ll ask: what happens at a boundary of a system\, when the bulk goes through a phase transition. While this question was studied in the context of classical statistical mechanics in the 70s and 80s\, basic aspects of the boundary phase diagram for the simplest classical phase transitions have been missed until recently. I’ll describe progress in this field\, as well as some extensions to quantum phase transitions. \n 
URL:https://cmsa.fas.harvard.edu/event/collquium-42623/
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-04.26.2023.rev2_.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20230420T133000
DTEND;TZID=America/New_York:20230420T143000
DTSTAMP:20260510T182058
CREATED:20230817T182708Z
LAST-MODIFIED:20240216T085423Z
UID:10001282-1681997400-1682001000@cmsa.fas.harvard.edu
SUMMARY:Black hole collider physics
DESCRIPTION:Speaker: Julio Parra Martinez\, Caltech \nTitle: Black hole collider physics \nAbstract: Despite more than a century since the development of Einstein’s theory\, the general relativistic two-body problem remains unsolved. A precise description of its solution is now essential\, as it is necessary for understanding the strong-gravity dynamics of compact binaries observed at LIGO/VIRGO/KAGRA and in future gravitational wave observatories. In this talk\, I will describe how considering the scattering of black holes and gravitons can shed new light on this problem. I will explain how using modern ideas from collider and particle physics we can calculate scattering observables in classical gravity\, and extract the basic ingredients that describe the bound binary dynamics. Such calculations have produced state-of-art predictions for current and future gravitational wave observatories\, which open the door for further discovery as we enter this new era of precision gravitational physics.
URL:https://cmsa.fas.harvard.edu/event/collquium-42023/
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-04.20.2023.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20230412T123000
DTEND;TZID=America/New_York:20230412T133000
DTSTAMP:20260510T182059
CREATED:20230817T182227Z
LAST-MODIFIED:20240215T103145Z
UID:10001281-1681302600-1681306200@cmsa.fas.harvard.edu
SUMMARY:Unexpected Uses of Neural Networks: Field Theory and Metric Flows  
DESCRIPTION:Speaker: James Halverson (Northeastern University)\n \nTitle: Unexpected Uses of Neural Networks: Field Theory and Metric Flows\nAbstract:  We are now quite used to the idea that deep neural networks may be trained in a variety of ways to tackle cutting-edge problems in physics and mathematics\, sometimes leading to rigorous results. In this talk\, however\, I will argue that breakthroughs in deep learning theory are also useful for making progress\, focusing on applications to field theory and metric flows. Specifically\, I will introduce a neural network approach to field theory with a different statistical origin\, that exhibits generalized free field behavior at infinite width and interactions at finite width\, and that allows for the study of symmetries via the study of correlation functions in a different duality frame. Then\, I will review recent progress in approximating Calabi-Yau metrics as neural networks and cast that story into the language of neural tangent kernel theory\, yielding a theoretical understanding of neural network metric flows induced by gradient descent and recovering famous metric flows\, such as Perelman’s formulation of Ricci flow\, in particular limits.
URL:https://cmsa.fas.harvard.edu/event/colloquium12523/
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/02CMSA-Colloquium-04.12.2023.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20230403T110000
DTEND;TZID=America/New_York:20230403T120000
DTSTAMP:20260510T182059
CREATED:20230817T181822Z
LAST-MODIFIED:20240122T052041Z
UID:10001280-1680519600-1680523200@cmsa.fas.harvard.edu
SUMMARY:Black hole microstate counting from the gravitational path integral
DESCRIPTION:Colloquium \nSpeaker: Luca Iliesiu\, Stanford \nTitle: Black hole microstate counting from the gravitational path integral \nAbstract: Reproducing the integer count of black hole micro-states from the gravitational path integral is an important problem in quantum gravity. In the first part of the talk\, I will show that\, by using supersymmetric localization\, the gravitational path integral for 1/16-BPS black holes in supergravity can reproduce the index obtained in the string theory construction of such black holes. A more refined argument then shows that not only the black hole index but also the total number of black hole microstates within an energy window above extremality that is polynomially suppressed in the charges also matches this string theory index. In the second part of the talk\, I will present a second perspective on this state count and show how the BPS Hilbert space can be obtained by directly preparing states using the gravitational path integral. While such a preparation naively gives rise to a Hilbert space of BPS states whose dimension is much larger than expected\, I will explain how non-perturbative corrections in the overlap of such states are again responsible for reproducing the correct dimension of the Hilbert space.
URL:https://cmsa.fas.harvard.edu/event/colloquium-4323/
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-04.03.2023.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20230329T123000
DTEND;TZID=America/New_York:20230329T133000
DTSTAMP:20260510T182059
CREATED:20230817T181436Z
LAST-MODIFIED:20240216T102824Z
UID:10001279-1680093000-1680096600@cmsa.fas.harvard.edu
SUMMARY:Scattering amplitudes in quantum field theory
DESCRIPTION:Speaker: Ruth Britto (Trinity College Dublin) \nTitle: Scattering amplitudes in quantum field theory \nAbstract: Particle collider experiments require a detailed description of scattering events\, traditionally computed through sums of Feynman diagrams. However\, it is not practical to evaluate Feynman diagrams directly for all significant scattering processes. Moreover\, adding all diagrams reveals many cancellations: scattering amplitudes in theories such as QCD take remarkably simple forms. This simplicity is a clue that the perturbative theory is perhaps best understood without reference to Feynman diagrams. In fact\, it has recently become possible to explain some of this simplicity. I will show how to derive many amplitudes efficiently and elegantly\, and propose taming the remaining complexity with ideas drawn from combinatorics and geometry.
URL:https://cmsa.fas.harvard.edu/event/collquium-32923/
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-03.29.2023.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20230322T123000
DTEND;TZID=America/New_York:20230322T133000
DTSTAMP:20260510T182059
CREATED:20230817T181152Z
LAST-MODIFIED:20240216T104444Z
UID:10001278-1679488200-1679491800@cmsa.fas.harvard.edu
SUMMARY:Synchronization in a Kuramoto Mean Field Game
DESCRIPTION:Speaker: Mete Soner (Princeton University) \nTitle: Synchronization in a Kuramoto Mean Field Game \nAbstract:  Originally motivated by systems of chemical and biological oscillators\, the classical Kuramoto model has found an amazing range of applications from neuroscience to Josephson junctions in superconductors\, and has become a  key mathematical model to describe self organization in complex systems. These autonomous oscillators are coupled through a nonlinear interaction term which plays a central role in the long term behavior of the system. While the system is not synchronized when this term is not sufficiently strong\, fascinatingly\, they exhibit an abrupt transition to a full synchronization above a critical value of the interaction parameter.  We explore this system in the mean field formalism.  We treat the system of oscillators as an infinite particle system\, but instead of positing the dynamics of the particles\, we let the individual particles determine endogenously their behaviors by minimizing a cost functional and eventually\, settling in a Nash equilibrium.  The mean field game also exhibits a bifurcation from incoherence to self-organization.  This approach has found interesting applications including circadian rhythms and jet-lag recovery.  This is joint work with Rene Carmona of Princeton and Quentin Cormier of INRIA\, Paris.
URL:https://cmsa.fas.harvard.edu/event/collquium-32223/
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-03.22.2023.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20230308T123000
DTEND;TZID=America/New_York:20230308T133000
DTSTAMP:20260510T182059
CREATED:20230817T180824Z
LAST-MODIFIED:20240228T111406Z
UID:10001277-1678278600-1678282200@cmsa.fas.harvard.edu
SUMMARY:Conformal symmetry\, Optimization algorithms and the Critical Phenomena
DESCRIPTION:Speaker: Ning Su\, University of Pisa \nTitle: Conformal symmetry\, Optimization algorithms and the Critical Phenomena \nAbstract: In the phase diagram of many substances\, the critical points have emergent conformal symmetry and are described by conformal field theories. Traditionally\, physical quantities near the critical point can be computed by perturbative field theory method\, where conformal symmetry is not fully utilized. In this talk\, I will explain how conformal symmetry can be used to determine certain physical quantities\, without even knowing the fine details of the microscopic structure. To compute the observables precisely\, one needs to develop powerful numerical techniques. In the last few years\, we have invented many computational tools and algorithms\, and predicted critical exponents of Helium-4 superfluid phase transition and Heisenberg magnet to very high precision.
URL:https://cmsa.fas.harvard.edu/event/collquium-3823/
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/02CMSA-Colloquium-03.08.2023.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20230302T160000
DTEND;TZID=America/New_York:20230302T170000
DTSTAMP:20260510T182059
CREATED:20230817T180503Z
LAST-MODIFIED:20240216T085143Z
UID:10001276-1677772800-1677776400@cmsa.fas.harvard.edu
SUMMARY:The string/black hole transition in anti de Sitter space
DESCRIPTION:Speaker: Erez Urbach\, Weizmann Institute of Science \nTitle: The string/black hole transition in anti de Sitter space \nAbstract: String stars\, or Horowitz-Polchinski solutions\, are string theory saddles with normalizable condensates of thermal-winding strings. In the past\, string stars were offered as a possible description of stringy (Euclidean) black holes in asymptotically flat spacetime\, close to the Hagedorn temperature. I will discuss the thermodynamic properties of string stars in asymptotically (thermal) anti-de Sitter background (including AdS3 with NS-NS flux)\, their possible connection to small black holes in AdS\, and their implications for holography. I will also present new “winding-string gas” saddles for confining holographic backgrounds such as the Witten model\, and their relation to the deconfined phase of 3+1 pure Yang-Mills.
URL:https://cmsa.fas.harvard.edu/event/collquium-3223/
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/02CMSA-Colloquium-03.02.2023.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20230222T123000
DTEND;TZID=America/New_York:20230222T133000
DTSTAMP:20260510T182059
CREATED:20230817T180053Z
LAST-MODIFIED:20240215T111058Z
UID:10001275-1677069000-1677072600@cmsa.fas.harvard.edu
SUMMARY:The Black Hole Information Paradox: A Resolution on the Horizon?
DESCRIPTION:Speaker: Netta Engelhardt (MIT) \nTitle: The Black Hole Information Paradox: A Resolution on the Horizon? \nAbstract: The black hole information paradox — whether information escapes an evaporating black hole or not — remains one of the most longstanding mysteries of theoretical physics. The apparent conflict between validity of semiclassical gravity at low energies and unitarity of quantum mechanics has long been expected to find its resolution in a complete quantum theory of gravity. Recent developments in the holographic dictionary\, and in particular its application to entanglement and complexity\, however\, have shown that a semiclassical analysis of gravitational physics can reproduce a hallmark feature of unitary evolution. I will describe this recent progress and discuss some promising indications of a full resolution of the information paradox.
URL:https://cmsa.fas.harvard.edu/event/collquium-22223/
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/02CMSA-Colloquium-02.22.2023.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20230213T123000
DTEND;TZID=America/New_York:20230213T133000
DTSTAMP:20260510T182059
CREATED:20230817T175704Z
LAST-MODIFIED:20240222T165748Z
UID:10001274-1676291400-1676295000@cmsa.fas.harvard.edu
SUMMARY:Complete Calabi-Yau metrics: Recent progress and open problems
DESCRIPTION:Speaker: Tristan Collins\, MIT \nTitle: Complete Calabi-Yau metrics: Recent progress and open problems \nAbstract: Complete Calabi-Yau metrics are fundamental objects in Kahler geometry arising as singularity models or “bubbles” in degenerations of compact Calabi-Yau manifolds.  The existence of these metrics and their relationship with algebraic geometry are the subjects of several long standing conjectures due to Yau and Tian-Yau. I will describe some recent progress towards the question of existence\, and explain some future directions\, highlighting connections with notions of algebro-geometric stability.
URL:https://cmsa.fas.harvard.edu/event/collquium-21323/
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/02CMSA-Colloquium-02.13.2023-.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20230208T123000
DTEND;TZID=America/New_York:20230208T133000
DTSTAMP:20260510T182059
CREATED:20230817T175326Z
LAST-MODIFIED:20240214T112702Z
UID:10001273-1675859400-1675863000@cmsa.fas.harvard.edu
SUMMARY:From spin glasses to Boolean circuits lower bounds - Algorithmic barriers from the overlap gap property
DESCRIPTION:Speaker: David Gamarnik (MIT) \nTitle: From spin glasses to Boolean circuits lower bounds. Algorithmic barriers from the overlap gap property \nAbstract: Many decision and optimization problems over random structures exhibit an apparent gap between the existentially optimal values and algorithmically achievable values. Examples include the problem of finding a largest independent set in a random graph\, the problem of finding a near ground state in a spin glass model\, the problem of finding a satisfying assignment in a random constraint satisfaction problem\, and many many more. Unfortunately\, at the same time no formal computational hardness results exist which  explains this persistent algorithmic gap. \nIn the talk we will describe a new approach for establishing an algorithmic intractability for these problems called the overlap gap property. Originating in statistical physics theory of spin glasses\, this is a simple to describe property which a) emerges in most models known to exhibit an apparent algorithmic hardness; b) is consistent with the hardness/tractability phase transition for many models analyzed to the day; and\, importantly\, c) allows to mathematically rigorously rule out a large class of algorithms as potential contenders\, specifically the algorithms which exhibit a form of stability/noise insensitivity. \nWe will specifically show how to use this property to obtain stronger (stretched exponential) than the state of the art (quasi-polynomial) lower bounds on the size of constant depth Boolean circuits for solving the two of the aforementioned problems: the problem of finding a large independent set in a sparse random graph\, and the problem of finding a near ground state of a p-spin model. \nJoint work with Aukosh Jagannath and Alex Wein
URL:https://cmsa.fas.harvard.edu/event/collquium-2823/
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/02CMSA-Colloquium-02.08.2023.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20230202T123000
DTEND;TZID=America/New_York:20230202T133000
DTSTAMP:20260510T182059
CREATED:20230817T175011Z
LAST-MODIFIED:20240121T174936Z
UID:10001272-1675341000-1675344600@cmsa.fas.harvard.edu
SUMMARY:Neural Optimal Stopping Boundary
DESCRIPTION:Speaker: Max Reppen (Boston University) \nTitle: Neural Optimal Stopping Boundary \nAbstract:  A method based on deep artificial neural networks and empirical risk minimization is developed to calculate the boundary separating the stopping and continuation regions in optimal stopping. The algorithm parameterizes the stopping boundary as the graph of a function and introduces relaxed stopping rules based on fuzzy boundaries to facilitate efficient optimization. Several financial instruments\, some in high dimensions\, are analyzed through this method\, demonstrating its effectiveness. The existence of the stopping boundary is also proved under natural structural assumptions.
URL:https://cmsa.fas.harvard.edu/event/colloquium_2223/
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/02CMSA-Colloquium-02.02.2023.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20221116T123000
DTEND;TZID=America/New_York:20221116T133000
DTSTAMP:20260510T182059
CREATED:20230817T174642Z
LAST-MODIFIED:20240214T112838Z
UID:10001271-1668601800-1668605400@cmsa.fas.harvard.edu
SUMMARY:Noether’s Learning Dynamics: Role of Symmetry Breaking in Neural Networks
DESCRIPTION:Colloquium \nSpeaker: Hidenori Tanaka (NTT Research at Harvard) \nTitle: Noether’s Learning Dynamics: Role of Symmetry Breaking in Neural Networks \nAbstract: In nature\, symmetry governs regularities\, while symmetry breaking brings texture. In artificial neural networks\, symmetry has been a central design principle\, but the role of symmetry breaking is not well understood. Here\, we develop a Lagrangian formulation to study the geometry of learning dynamics in neural networks and reveal a key mechanism of explicit symmetry breaking behind the efficiency and stability of modern neural networks. Then\, we generalize Noether’s theorem known in physics to describe a unique symmetry breaking mechanism in learning and derive the resulting motion of the Noether charge: Noether’s Learning Dynamics (NLD). Finally\, we apply NLD to neural networks with normalization layers and discuss practical insights. Overall\, through the lens of Lagrangian mechanics\, we have established a theoretical foundation to discover geometric design principles for the learning dynamics of neural networks.
URL:https://cmsa.fas.harvard.edu/event/collquium-111622/
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.16.22-2.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20221102T124500
DTEND;TZID=America/New_York:20221102T134500
DTSTAMP:20260510T182059
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:20260510T182059
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
END:VCALENDAR