Events Search and Views Navigation

Event Views Navigation

Today

  • The Cubical Route to Understanding Groups

    Speaker: Daniel Wise (McGill University) Title: The Cubical Route to Understanding Groups Abstract: Cube complexes have come to play an increasingly central role within geometric group theory, as their connection to right-angled Artin groups provides a powerful combinatorial bridge between geometry and algebra. This talk will introduce nonpositively curved cube complexes, and then describe the developments that culminated in the resolution of the virtual […]

  • Quantum Money from Lattices

    CMSA 20 Garden Street, Cambridge, MA, United States

    Speaker: Peter Shor (MIT) Title: Quantum Money from Lattices Abstract: Quantum money is a cryptographic protocol for quantum computers. A quantum money protocol consists of a quantum state which can be created (by the mint) and verified (by anybody with a quantum computer who knows what the "serial number" of the money is), but which cannot be duplicated, even by somebody with a copy of the quantum state who knows the verification protocol. Several previous proposals have […]

  • Fluid Dynamics Seminar

    Beginning immediately, until at least April 30, all seminars will take place virtually, through Zoom. Links to connect can be found in the schedule below once they are created.  In the Spring 2019 Semester, the Center of Mathematical Sciences and Applications will be hosting a seminar on Fluid Dynamics. The seminar will take place on Wednesdays from 3:00-4:00pm […]

  • Previous Random Matrix & Probability Theory Seminars

    Spring 2020: Date Speaker Title/Abstract 2/26/2020 Louigi Addario-Berry (McGill University) Title: Hipster random walks and their ilk  Abstract: I will describe how certain recursive distributional equations can be solved by importing rigorous results on the convergence of approximation schemes for degenerate PDEs, from numerical analysis. This project is joint work with Luc Devroye, Hannah Cairns, Celine Kerriou, […]

  • Derandomizing Algorithms via Spectral Graph Theory

    CMSA 20 Garden Street, Cambridge, MA, United States

    Speaker: Salil Vadhan (Harvard) Title: Derandomizing Algorithms via Spectral Graph Theory Abstract: Randomization is a powerful tool for algorithms; it is often easier to design efficient algorithms if we allow the algorithms to "toss coins" and output a correct answer with high probability.  However, a longstanding conjecture in theoretical computer science is that every randomized algorithm can be efficiently "derandomized" […]