• Induced subgraphs and tree decompositions

    Speaker: Maria Chudnovsky, Princeton Title: Induced subgraphs and tree decompositions Abstract: Tree decompositions are a powerful tool in both structural graph theory and graph algorithms. Many hard problems become tractable if the […]

  • Defects, link invariants and exact WKB

    Virtual

    Speaker: Fei Yan (Rutgers) Title: Defects, link invariants and exact WKB Abstract: I will describe some of my recent work on defects in supersymmetric field theories. The first part of my talk […]

  • Hierarchical Transformers are More Efficient Language Models

    Virtual

    https://youtu.be/soqWNyrdjkw Speaker: Piotr Nawrot, University of Warsaw Title: Hierarchical Transformers are More Efficient Language Models Abstract: Transformer models yield impressive results on many NLP and sequence modeling tasks. Remarkably, Transformers can […]

  • CMSA Math-Science Literature Lecture – Karen Uhlenbeck

    Virtual

    Karen Uhlenbeck (Institute for Advanced Study) Title: The Noether Theorems in Geometry: Then and Now Abstract: The 1918 Noether theorems were a product of the general search for energy and […]

  • 12/9/21 Interdisciplinary Science Seminar

    Title: Numerical Higher Dimensional Geometry Abstract: In 1977, Yau proved that a Kahler manifold with zero first Chern class admits a Ricci flat metric, which is uniquely determined by certain “moduli” data. […]

  • On the solution space of the Ising perceptron model

    Member Seminar Speaker: Changji Xu Title: On the solution space of the Ising perceptron model Abstract:  Consider the discrete cube $\{-1,1\}^N$ and a random collection of half spaces which includes each […]

  • The longest induced path in a sparse random graph

    Abstract: A long-standing problem in random graph theory has been to determine asymptotically the length of a longest induced path in sparse random graphs. Independent work of Luczak and Suen from […]