Events Search and Views Navigation

Event Views Navigation

Today

During 2025–26, the CMSA will host a seminar on New Technologies in Mathematics, organized by Michael Douglas and Blake Bordelon. This seminar will take place on Wednesdays from 2:00 pm–3:00 pm (Eastern Time). The meetings will take place in Room G10 at the CMSA, 20 Garden Street, Cambridge MA 02138, and some meetings will take place virtually on Zoom or be held in hybrid formats. To learn how to attend, please fill out this form, or contact Michael Douglas (mdouglas@cmsa.fas.harvard.edu).

The schedule will be updated as talks are confirmed.

Seminar videos can be found at the CMSA Youtube site: New Technologies in Mathematics Playlist

  • CMSA-New-Technologies-in-Mathematics-03.10.21

    The Ramanujan Machine: Using Algorithms for the Discovery of Conjectures on Mathematical Constants

    Virtual

    https://youtu.be/h0FW7l7z-C4 Speaker: Ido Kaminer, Technion – Israel Institute of Technology, Faculty of Electrical Engineering Title: The Ramanujan Machine: Using Algorithms for the Discovery of Conjectures on Mathematical Constants Abstract: In the past, new conjectures about fundamental constants were discovered sporadically by famous mathematicians such as Newton, Euler, Gauss, and Ramanujan. The talk will present a […]

  • 3/24/2021 New Tech in Math Seminar

    Word and Graph Embeddings for Machine Learning

    https://youtu.be/-DKctbabRkY Speaker: Steve Skiena, Dept. of Computer Science and AI Insititute, Stony Brook University Title: Word and Graph Embeddings for Machine Learning Abstract: DeepWalk is an approach we have developed to construct vertex embeddings: vector representations of vertices which be applied to a very general class of problems in data mining and information retrieval. DeepWalk […]

  • 3/31/2021 New Tech in Math

    Doing Mathematics with Simple Types: Infinitary Combinatorics in Isabelle/HOL

    https://youtu.be/LZMtQNdqtvc Speaker: Lawrence Paulson, University of Cambridge Computer Laboratory Title: Doing Mathematics with Simple Types: Infinitary Combinatorics in Isabelle/HOL Abstract: Are proof assistants relevant to mathematics? One approach to this question is to explore the breadth of mathematical topics that can be formalised. The partition calculus was introduced by Erdös and R. Rado in 1956 […]

  • 4/7/2021 New Technologies in Mathematics Seminar

    Type theory from the perspective of artificial intelligence

    https://youtu.be/79ymkGQW3b4 Speaker: David McAllester - Toyota Technological Institute at Chicago Title: Type theory from the perspective of artificial intelligence Abstract: This talk will discuss dependent type theory from the perspective of artificial intelligence and cognitive science. From an artificial intelligence perspective it will be argued that type theory is central to defining the "game" of mathematics […]

  • CMSA-New-Technologies-in-Mathematics-04.14.21

    A Bayesian neural network predicts the dissolution of compact planetary systems

    Virtual

    https://youtu.be/VhseP2V3NXg Speaker: Miles Cranmer - Princeton University Title: A Bayesian neural network predicts the dissolution of compact planetary systems Abstract: Despite over three hundred years of effort, no solutions exist for predicting when a general planetary configuration will become unstable. I will discuss our deep learning architecture (arxiv:2101.04117) which pushes forward this problem for compact systems. […]

  • CMSA-New-Technologies-in-Mathematics-04.21.21

    Homotopy type theory and the quest for extensionality

    Virtual

    Speaker: Michael Shulman - Dept. of Mathematics, University of San Diego Title: Homotopy type theory and the quest for extensionality Abstract: Over the past decades, dependent type theory has proven to be a powerful framework for verified software and formalized mathematics.  However, its treatment of equality has always been somewhat uncomfortable.  Recently, homotopy type theory has […]

  • The complexity of matrix multiplication approached via algebraic geometry and representation theory

    https://youtu.be/leONsS4LiV4 Speaker: JM Landsberg, Texas A&M Title: The complexity of matrix multiplication approached via algebraic geometry and representation theory Abstract: In 1968 V. Strassen discovered the way we usually multiply matrices is not the most efficient possible, and after considerable work by many authors, it is generally conjectured by computer scientists that as the size […]

  • Why abstraction is the key to intelligence, and what we’re still missing

    https://youtu.be/3Nxe7J07TQY Speaker: Francois Chollet, Google Title: Why abstraction is the key to intelligence, and what we’re still missing Abstract: This talk provides a personal perspective on the way forward towards more human-like and more intelligent artificial systems. Traditionally, symbolic and probabilistic methods have dominated the domains of concept formation, abstraction, and automated reasoning. More recently, deep […]

  • Constructions in combinatorics via neural networks

    https://youtu.be/ufG0YLj_sik Speaker: Adam Wagner, Tel Aviv University Title: Constructions in combinatorics via neural networks Abstract: Recently, significant progress has been made in the area of machine learning algorithms, and they have quickly become some of the most exciting tools in a scientist’s toolbox. In particular, recent advances in the field of reinforcement learning have led […]

  • New results in Supergravity via ML Technology

    https://youtu.be/zJOWdZZcitk Speaker: Thomas Fischbacher, Google Title: New results in Supergravity via ML Technology Abstract: The infrastructure built to power the Machine Learning revolution has many other uses beyond Deep Learning. Starting from a general architecture-level overview over the lower levels of Google’s TensorFlow machine learning library, we review how this has recently helped us to […]

  • Computer-Aided Mathematics and Satisfiability

    https://youtu.be/4wHwqYrCqVQ Speaker: Marijn Heule, Carnegie Mellon University Title: Computer-Aided Mathematics and Satisfiability Abstract: Progress in satisfiability (SAT) solving has made it possible to determine the correctness of complex systems and answer long-standing open questions in mathematics. The SAT solving approach is completely automatic and can produce clever though potentially gigantic proofs. We can have confidence […]

  • Why explain mathematics to computers?

    https://youtu.be/rRGh97sOtKE Speaker: Patrick Massot, Laboratoire de Mathématiques d’Orsay and CNRS Title: Why explain mathematics to computers? Abstract: A growing number of mathematicians are having fun explaining mathematics to computers using proof assistant softwares. This process is called formalization. In this talk I’ll describe what formalization looks like, what kind of things it teaches us, and […]