news

See Older News

announcements

Big Data Conference 2024
September 6, 2024 - September 7, 2024      9:00 am
https://cmsa.fas.harvard.edu/event/bigdata_2024/   On  September 6-7, 2024, the CMSA will host the tenth annual Conference on Big Data. The Big Data Conference features speakers from the...
Read more
See Older Announcements

upcoming events

< 2021 >
February
«
»
Sun
Mon
Tue
Wed
Thu
Fri
Sat
January
1
2
  • MATHEMATICAL PICTURE LANGUAGE SEMINAR: W*-rigidity paradigms for embeddings of II1 factors

    MATHEMATICAL PICTURE LANGUAGE SEMINAR
    W*-rigidity paradigms for embeddings of II1 factors

    Speaker: Stefaan Vaes – Katholieke Universiteit Leuven

    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

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

    Speaker: Shweta Jain – University of Illinois, Urbana-Champaign

    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

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

    Speaker: Philip Phillips – University of Illinois Urbana-Champaign

    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

  • NUMBER THEORY SEMINAR: Analytic geometry

    NUMBER THEORY SEMINAR
    Analytic geometry

    Speaker: Peter Scholze – University of Bonn

    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.

  • OPEN NEIGHBORHOOD SEMINAR: Math Table/Open Neighborhood Seminar: Universality in random algebraic structures

    Speaker: Melanie Wood – Harvard University

    4:30 PM-5:30 PM
    February 3, 2021

    We will explore the idea of universality in probability theory, as seen in the central limit theorem, in which wide and varied input distributions can all give identical limiting outputs. We will then explore examples of universality in random algebraic structures, such as random vector spaces over finite fields. We will explain how this is connected to recent research on random integral matrices and distributions of class groups of number fields.

    Please go to the College Calendar to register.

4
5
6
7
8
9
  • MATHEMATICAL PICTURE LANGUAGE SEMINAR: Many-body localization near the critical point

    MATHEMATICAL PICTURE LANGUAGE SEMINAR
    Many-body localization near the critical point

    Speaker: John Imbrie – University of Virginia

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

    I will examine the many-body localization (MBL) phase transition in one-dimensional quantum systems with quenched randomness. Having demonstrated the existence of the MBL phase at strong disorder, under a level-statistics assumption, I will focus on the nature of the transition out of this phase, using an approximate strong-disorder renormalization group. In this approach, the phase transition is due to the so-called avalanche instability of the MBL phase. I show that the critical behavior can be determined analytically within this RG. The RG flow near the critical fixed point is qualitatively similar to the Kosterlitz-Thouless (KT) flow, but there are important differences, and so this MBL transition is in a universality class that is distinct from KT. The divergence of the correlation length corresponds to critical exponent ν →∞, but the divergence is weaker than for the KT transition. This is joint work with Alan Morningstar and David Huse.

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

  • CMSA EVENT: CMSA Computer Science for Mathematicians: Point Location and Active Learning – Learning Halfspaces Almost Optimally

    Speaker: Max Hopkins – UCSD

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

    The point location problem is a fundamental question in computational geometry. It asks, given a known partition of R^d into cells by n hyperplanes and an unknown input point x, which cell contains x? More formally, given access to x via linear queries (i.e. for any hyperplane h in R^d we may ask: “is x above or below h?”), our goal is to locate the cell containing x in as few queries as possible.

    In its dual formulation, point location is equivalent to a well-studied problem in machine learning: active learning halfspaces. In this version of the problem, we are given a known set of data points X in R^d, and an unknown hyperplane h. The goal is to label all points in X by asking as few linear queries as possible, where in this formulation a linear query simply corresponds to asking for the label of some point in R^d.

    It has long been known that solving the point location problem on n hyperplanes in d-dimensions requires at least Omega(dlog(n)) queries. Over the past 40 years, a series of works in the computational geometry literature lowered the corresponding upper bound to O(d^2log(d)log(n)). In this talk, we show how taking a learning theoretic approach to the problem allows us to reach near-linear dependence on d.  The proof combines old margin-based learning and vector-scaling techniques with a novel structural decomposition used for dimensionality reduction.

    Based on joint work with Daniel Kane, Shachar Lovett, and Gaurav Mahajan.

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

  • HARVARD-MIT ALGEBRAIC GEOMETRY SEMINAR: The Kodaira dimension of the moduli space of curves: recent progress on a century-old problem

    Speaker: Gavril Farkas – Humboldt University, Berlin

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

    The problem of determining the birational nature of the moduli space of curves of genus g has received constant attention in the last century and inspired a lot of development in moduli theory. I will discuss progress achieved in the last 12 months. On the one hand, making essential of tropical methods it has been showed that both moduli spaces of curves of genus 22 and 23 are of general type (joint with D. Jensen and S. Payne). On the other hand I will discuss a proof (joint with A. Verra) of the uniruledness of the moduli space of curves of genus 16.

    Zoom: https://harvard.zoom.us/j/91794282895?pwd=VFZxRWdDQ0VNT0hsVTllR0JCQytoZz09

10
11
12
13
14
15
16
  • MATHEMATICAL PICTURE LANGUAGE SEMINAR: Elements of ∞-category theory

    MATHEMATICAL PICTURE LANGUAGE SEMINAR
    Elements of ∞-category theory

    Speaker: Emily Riehl – Johns Hopkins University

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

    Confusingly for the uninitiated, experts in infinite-dimensional category theory make use of different definitions of an ∞-category, and theorems in the ∞-categorical literature are often proven “analytically”, in reference to the combinatorial specifications of a particular model. In this talk, we present a new point of view on the foundations of ∞-category theory, which allows us to develop the basic theory of ∞-categories — adjunctions, limits and colimits, co/cartesian fibrations, and pointwise Kan extensions — “synthetically” starting from axioms that describe an ∞-cosmos, the infinite-dimensional category in which ∞-categories live as objects. We demonstrate that the theorems proven in this manner are “model-independent”, i.e., invariant under change of model. Moreover, there is a formal language with the feature that any statement about ∞-categories that is expressible in that language is also invariant under change of model, regardless of whether it is proven through synthetic or analytic techniques. This is joint work with Dominic Verity.

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

  • CMSA EVENT: CMSA Computer Science for Mathematicians: Outcome Indistinguishability

    Speaker: Michael P. Kim – Miller Institute at UC Berkeley

    1:30 PM-2:30 PM
    February 16, 2021

    Prediction algorithms assign numbers to individuals that are popularly understood as individual “probabilities” — e.g., what is the probability of 5-year survival after cancer diagnosis? — and which increasingly form the basis for life-altering decisions. The understanding of individual probabilities in the context of such unrepeatable events has been the focus of intense study for decades within probability theory, statistics, and philosophy. Building off of notions developed in complexity theory and cryptography, we introduce and study Outcome Indistinguishability (OI). OI predictors yield a model of probabilities that cannot be efficiently refuted on the basis of the real-life observations produced by Nature.

    We investigate a hierarchy of OI definitions, whose stringency increases with the degree to which distinguishers may access the predictor in question.  Our findings reveal that OI behaves qualitatively differently than previously studied notions of indistinguishability.  First, we provide constructions at all levels of the hierarchy.  Then, leveraging recently-developed machinery for proving average-case fine-grained hardness, we obtain lower bounds on the complexity of the more stringent forms of OI.  The hardness result provides scientific grounds for the political argument that, when inspecting algorithmic risk prediction instruments, auditors should be granted oracle access to the algorithm, not simply historical predictions.

    Joint work with Cynthia Dwork, Omer Reingold, Guy N. Rothblum, Gal Yona; to appear at STOC 2021.

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

  • HARVARD-MIT ALGEBRAIC GEOMETRY SEMINAR: On the proportion of transverse-free curves

    HARVARD-MIT ALGEBRAIC GEOMETRY SEMINAR
    On the proportion of transverse-free curves

    Speaker: Shamil Asgarli –

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

    Given a smooth plane curve C defined over an arbitrary field k, we say that C is transverse-free if it has no transverse lines defined over k. If k is an infinite field, then Bertini’s theorem guarantees the existence of a transverse line defined over k, and so the transverse-free condition is interesting only in the case when k is a finite field F_q. After fixing a finite field F_q, we can ask the following question: For each degree d, what is the fraction of degree d transverse-free curves among all the degree d curves? In this talk, we will investigate an asymptotic answer to the question as d tends to infinity. This is joint work with Brian Freidin.

    Zoom: https://harvard.zoom.us/j/91794282895?pwd=VFZxRWdDQ0VNT0hsVTllR0JCQytoZz09

17
18
19
20
21
22
23
24
  • CMSA EVENT: CMSA Colloquium: Electric-Magnetic Duality for Periods and L-functions

    Speaker: David Ben-Zvi – U Texas

    9:00 AM-10:00 AM
    February 24, 2021

    I will describe joint work with Yiannis Sakellaridis and Akshay Venkatesh, in which ideas originating in quantum field theory are applied to a problem in number theory.
    A fundamental aspect of the Langlands correspondence — the relative Langlands program — studies the representation of L-functions of Galois representations as integrals of automorphic forms. However, the data that naturally index the period integrals (spherical varieties for G) and the L-functions (representations of the dual group G^) don’t seem to line up.
    We present an approach to this problem via the Kapustin-Witten interpretation of the [geometric] Langlands correspondence as electric-magnetic duality for 4-dimensional supersymmetric Yang-Mills theory. Namely, we rewrite the relative Langlands program as duality in the presence of supersymmetric boundary conditions. As a result, the partial correspondence between periods and L-functions is embedded in a natural duality between Hamiltonian actions of the dual groups.

    For security reasons, you are kindly asked to show your full name while joining the meeting.

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

  • CMSA EVENT: CMSA Quantum Matter in Mathematics and Physics: A Riemann sum of quantum field theory: lattice Hamiltonian realization of TQFTs

    Speaker: Zhenghan Wang – Microsoft Station Q

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

    Walker and I wrote down a lattice model schema to realize the (3+1)-Crane-Yetter TQFTs based on unitary pre-modular categories many years ago, and application of the model is found in a variety of places such as quantum cellular automata and fracton physics.  I will start with the conceptual origin of this model as requested by the organizer.  Then I will discuss a general idea for writing down lattice realizations of state-sum TQFTs based on gluing formulas of TQFTs and explain the model for Crane-Yetter TQFTs on general three manifolds.  In the end, I will mention lattice models that generalize the Haah codes in two directions:  general three manifolds and more than two qubits per site.

    If the path integral of a quantum field theory is regarded as a generalization of the ordinary definite integral, then a lattice model of a quantum field theory could be regarded as an analogue of a Riemann sum.  New lattice models in fracton physics raise an interesting question:  what kinds of quantum field theories are they approximating if their continuous limits exist?  Their continuous limits would be rather unusual as the local degrees of freedom of such lattice models increase under entanglement renormalization flow.

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

  • CMSA EVENT: CMSA New Technologies in Mathematics: A Mathematical Language

    Speaker: Thomas Hales – University of Pittsburgh

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

    A controlled natural language for mathematics is an artificial language that is designed in an explicit way with precise computer-readable syntax and semantics. It is based on a single natural language (which for us is English) and can be broadly understood by mathematically literate English speakers. This talk will describe the design of a controlled natural language for mathematics that has been influenced by the Lean theorem prover, by TeX, and by earlier controlled natural languages. The semantics are provided by dependent type theory.

    Zoom: https://harvard.zoom.us/j/99018808011?pwd=SjRlbWFwVms5YVcwWURVN3R3S2tCUT09

  • NUMBER THEORY SEMINAR: On the Calegari–Emerton conjectures for abelian type Shimura varieties

    Speaker: Christian Johansson – Chalmers/Gothenburg

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

    Emerton’s completed cohomology gives, at present, the most general notion of a space of p-adic automorphic forms. Important properties of completed cohomology, such as its ‘size’, is predicted by a conjecture of Calegari and Emerton, which may be viewed as a non-abelian generalization of the Leopoldt conjecture. I will discuss the proof of many new cases of this conjecture, using a mixture of techniques from p-adic and real geometry. This is joint work with David Hansen.

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

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

25
  • CMSA EVENT: CMSA Quantum Matter in Mathematics and Physics: Exploring Non-Supersymmetric String Theory

    Speaker: Justin Kaidi – SCGP

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

    Walker and I wrote down a lattice model schema to realize the (3+1)-Crane-Yetter TQFTs based on unitary pre-modular categories many years ago, and application of the model is found in a variety of places such as quantum cellular automata and fracton physics.  I will start with the conceptual origin of this model as requested by the organizer.  Then I will discuss a general idea for writing down lattice realizations of state-sum TQFTs based on gluing formulas of TQFTs and explain the model for Crane-Yetter TQFTs on general three manifolds.  In the end, I will mention lattice models that generalize the Haah codes in two directions:  general three manifolds and more than two qubits per site.

    If the path integral of a quantum field theory is regarded as a generalization of the ordinary definite integral, then a lattice model of a quantum field theory could be regarded as an analogue of a Riemann sum.  New lattice models in fracton physics raise an interesting question:  what kinds of quantum field theories are they approximating if their continuous limits exist?  Their continuous limits would be rather unusual as the local degrees of freedom of such lattice models increase under entanglement renormalization flow.

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

26
27
28
March
March
March
March
March
March