Video Lectures

Finding the longest increasing subsequence (LIS) is a classic algorithmic problem. Simple $O(n log n)$ algorithms, based on dynamic programming, are known for solving this problem exactly on arrays of length $n$.

In this talk I'll discuss...

Given a Hamiltonian on $T^n\times R^n$, we shall explain how the sequence of suitably rescaled (i.e. homogenized) Hamiltonians, converges, for a suitably defined symplectic metric. We shall then explain some applications, in particular to symplectic...

I will talk about the computational complexity of computing the noncommutative determinant. In contrast to the case of commutative algebras, we know of (virtually) no efficient algorithms to compute the determinant over non-commutative domains...

Over the past decades, much attention has been devoted to the detection of small inhomogeneities in materials or tissues, using non-invasive techniques, primarily electromagnetic wave-fields. The characterization of the signature of small inclusions...

The 2010–11 season of Writers Conversations, curated by Institute Artist-in-Residence Derek Bermel, began with a reading and discussion with a younger generation of groundbreaking poets.

Tracy K. Smith, the host of the panel, is Assistant Professor...

(Introduction to the Lecture Series and and overview for those unable to attend the whole Lecture Series)

The cohomology of arithmetic groups (with real coefficients) is usually understood in terms of automorphic forms. Such methods, however, fail (at least naively) to capture information about torsion classes in integral cohomology. We discuss a...

In this talk I will overview two very different kinds of random simplicial complex, both of which could be considered higher-dimensional generalizations of the Erdos-Renyi random graph, and discuss what is known and not known about the expected...