Previous Conferences & Workshops

Let F be a presheaf with transfers on the category of smooth affinoid varieties over a non-archemidean field. Suppose that F is overconvergent and homotopy invariant. Then the presheaves H^i(-,F) are also homotopy invariant (where the cohomology is...

I will describe a system of differential equations for the genus 0 open Gromov-Witten potential of a Lagrangian submanifold fixed by an anti-symplectic involution. These equations involve both the open Gromov-Witten potential and the closed Gromov...

Since the proof of Iwasawa's main conjecture in the classical case (theorem of Mazur and Wiles), automorphic forms on GL(2) have played an essential role to understand Iwasawa theory for GL(1). In this lecture, Leopoldt 's conjecture for totally...

Consider an arrangement of nonsingular subvarieties in a nonsingular algebraic variety. We define a compactification of the complement by replacing these subvarieties with a normal crossing divisor. This compactification is obtained by a sequence of...

In the past 2 years there has been considerable progress in the algorithmic problem of combining rankings (permutations on a ground set of "candidates") into a consensus ranking. This problem dates back to the 18th century, when the French...

In 1951 Nash proved that every game has a Nash equilibrium. The proof is non-constructive, reducing the existence of Nash equilibria to that of Brouwer fixpoints. Whether Nash equilibria can be computed efficiently had remained open. I shall outline...

In the first talk I reviewed the basic properties of linear feedback shift registers and their analysis using generating functions and trace functions. I then defined feedback with carry shift registers (FCSRs) and began their analysis by N-adic...

Many Floer-type theories are the categorifications of classical invariants. We describe a program of classification of such theories: we consider them as local systems on the spaces of manifolds that we constructed and extend them to the singular...

Traditional algorithm design is being challenged by the remarkable technological advances in data acquisition of recent years. Today's algorithms must often cope with data that is massive, noisy, uncertain, high-dimensional, nonuniformly priced...