Calendar

< 2021 >
February
  • 01
    February 1, 2021

    CMSA Mathematical Physics Seminar: Fukaya category of Landau-Ginzburg orbifolds

    10:00 AM-11:00 AM
    February 1, 2021

    Landau-Ginzburg orbifold is just another name for a holomorphic function W with its abelian symmetry G. Its Fukaya category can be viewed as a categorification of a homology group of its Milnor fiber. In this introductory talk, we will start with some classical results on the topology of isolated singularities and its Fukaya-Seidel category. Then I will explain a new construction for such category to deal with a non-trivial symmetry group G. The main ingredients are classical variation map and the Reeb dynamics at the contact boundary. If time permits, I will show its application to mirror symmetry of LG orbifolds and its Milnor fiber. This is a joint work with C.-H. Cho and W. Jeong.

    Zoom: https://harvard.zoom.us/j/91780604388?pwd=d3BqazFwbDZLQng0cEREclFqWkN4UT09

  • 02
    February 2, 2021

    W*-rigidity paradigms for embeddings of II1 factors

    10:00 AM-11:00 AM
    February 2, 2021

    I will report on a recent joint work with Sorin Popa in which we undertake a systematic study of W*-rigidity paradigms for the embedding relation between II1 factors and their amplifications. We say that a II1factor M stably embeds into a II1 factor N if M may be realized as a subfactor of an amplification of N, not necessarily of finite index. This is a preorder relation and we prove that it is as complicated as it can be: under the appropriate separability assumptions, we concretely realize any partially ordered set inside the preordered class of II1 factors with embeddability.

    Zoom: https://harvard.zoom.us/j/779283357?pwd=MitXVm1pYUlJVzZqT3lwV2pCT1ZUQT09

  • 02
    February 2, 2021

    CMSA Computer Science for Mathematicians: Counting cliques in real-world graphs

    11:30 AM-12:30 PM
    February 2, 2021

    Cliques are important structures in network science that have been used in numerous applications including spam detection, graph analysis, graph modeling, community detection among others. Obtaining the counts of k-cliques in real-world graphs with millions of nodes and edges is a challenging problem due to combinatorial explosion. Essentially, as k increases, the number of k-cliques goes up exponentially. Existing techniques are (typically) able to count k-cliques for only up to k=5.

    In this talk, I will present two algorithms for obtaining k-clique counts that improve the state of the art, both in theory and in practice. The first method is a randomized algorithm that gives a (1+ε)-approximation for the number of k-cliques in a graph. Its running time is proportional to the size of an object called the Turán Shadow, which, for real-world graphs is found to be small. In practice, this algorithm works well for k<=10 and gives orders of magnitude improvement over existing methods. This paper won the Best Paper Award at WWW, 2017.

    The second method, a somewhat surprising result, is a simple but powerful algorithm called Pivoter that gives the exact k-clique counts for all k and runs in O(n3^{n/3}) time in the worst case. It uses a classic technique called pivoting that drastically cuts down the search space for cliques and builds a structure called the Succinct Clique Tree from which global and local (per-vertex and per-edge) k-clique counts can be easily read off. In practice, the algorithm is orders of magnitude faster than even other parallel algorithms and makes clique counting feasible for a number of graphs for which clique counting was infeasible before. This paper won the Best Paper Award at WSDM, 2020.

    Zoom: https://harvard.zoom.us/j/98231541450

  • 03
    February 3, 2021

    CMSA Strongly Correlated Quantum Materials and High-Temperature Superconductors Series: Beyond BCS: An Exact Model for Superconductivity and Mottness

    10:30 AM-12:00 PM
    February 3, 2021

    High-temperature superconductivity in the cuprates remains an unsolved problem because the cuprates start off their lives as Mott insulators in which no organizing principle such a Fermi surface can be invoked to treat  the electron interactions.  Consequently, it would be advantageous to solve even a toy model that exhibits both Mottness and superconductivity.  Part of the problem is that the basic model for a Mott insulator, namely the Hubbard model is unsolvable in any dimension we really care about.  To address this problem, I will start by focusing on the overlooked Z_2 emergent symmetry of a Fermi surface first noted by Anderson and Haldane.  Mott insulators  break this emergent symmetry.  The simplest model of this type is due to Hatsugai/Kohmoto.  I will argue that this model can be thought of a fixed point for Mottness.  I will then show exactly[1] that this model when appended with a weak pairing interaction exhibits not only the analogue of Cooper’s instability but also a superconducting ground state, thereby demonstrating that a model for a doped Mott insulator can exhibit superconductivity.  The properties of the superconducting state differ drastically from that of the standard BCS theory.  The elementary excitations of this superconductor are not linear combinations of particle and hole states but rather are superpositions of doublons and holons, composite excitations signaling that the superconducting ground state of the doped Mott insulator inherits the non-Fermi liquid character of the normal state. Additional unexpected features of this model are that it exhibits a superconductivity-induced transfer of spectral weight from high to low energies and a suppression of the superfluid density as seen in the cuprates.

    [1] PWP, L. Yeo, E. Huang, Nature Physics, 16, 1175-1180 (2020).

    Zoom: https://harvard.zoom.us/j/977347126

  • 03
    February 3, 2021

    Analytic geometry

    3:00 PM-4:00 PM
    February 3, 2021

    We will outline a definition of analytic spaces that relates
    to complex- or rigid-analytic varieties in the same way that schemes
    relate to algebraic varieties over a field. Joint with Dustin Clausen.

    Zoom: https://harvard.zoom.us/j/99334398740

    Password: The order of the permutation group on 9 elements.