Previous Conferences & Workshops

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...

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 recent work of...

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. Our...

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...

In 1993, Sczech defined an n-1 cocycle on GL_n(Z) valued in a certain space of distributions. He showed that specializations of this cocyle yield the values of the partial zeta functions of totally real fields of degree n at nonpositive integers. In...

The space of all positions of n disks of radius r in a bounded region has long been studied from the points of view of statistical mechanics and probability. A phase transition is known to occur from simulations, but this is still mysterious to...