When, on an autumn Medina night in 61/680, the night that saw
al-Ḥusayn killed, Umm Salama was torn from her sleep by an
apparition of a long-dead Muḥammad, she slipped effortlessly into a
progression of her co-religionists who, irrespective of...
Professor Keeanga-Yamahtta Taylor’s presentation will examine
the ways that housing policies inspired and shaped by private
sector organizations undermined the federal government's ability to
enforce fair housing rules and regulations long after the...
The detections of gravitational waves from compact binary
mergers and the followup observations of electromagnetic emissions
together provide a powerful and independent tool to explore the
Universe. With successive upgrades to the LIGO and Virgo...
In the first of two lectures I will present a pedagogical
exploration of perhaps the simplest random matrix model, the
Gaussian Unitary Ensemble. It gives the Airy model in the double
scaling limit. I will first review the features that we
usually...
This lecture serves as a background for the upcoming talk by
Bharatram Rangarajan. I will review some aspects of bounded
cohomology, including why it appears to have some relevance to
stability questions. I will then explain vanishing results
for...
In recent years, a new “fine-grained” theory of computational
hardness has been developed, based on “fine-grained reductions”
that focus on exact running times for problems.
We follow the fashion of NP-hardness in a more delicate manner.
We...
I will discuss features of the static responses of black
holes in General Relativity. In particular, I will describe how
black hole static responses are defined in point particle effective
theory and will explain how the vanishing of black hole...
I will describe how the orbit method can be developed in a
quantitative form, along the lines of microlocal analysis, and
applied to local problems in representation theory and global
problems involving the analysis of automorphic forms. This
talk...
Understanding the complexity of the Minimum Circuit Size Problem
(MCSP) is a longstanding mystery in theoretical computer science.
Despite being a natural problem about circuits (given a Boolean
function's truth table, determine the size of the...
