Previous Conferences & Workshops

The Goncharov reading group is an informal seminar which will read the paper "Volumes of hyperbolic manifolds and mixed Tate motives" and related materials. We will meet on Wednesdays at 10 am in Simonyi 114.

We review some of the connections, established and expected between random matrix theory and Zeta functions. We also discuss briefly some recent Universality Conjectures connected with families of L-functions.

Expanders are highly connected sparse graphs. Simplicial complexes are a natural generalization of graphs to higher dimension, and the notions of connectedness and expansion turn out to have interesting analogues, which relate to the homology and...

This will be a gentle intro, aimed at a general mathematical audience, to supergeometry: supermanifolds, super Riemann surfaces, super moduli, etc. As time permits, we will discuss various aspects of supergeometry, including deformation theory and...

The time evolution of an ideal incompressible fluid is described by the Euler equations. In this mostly speculative talk I will discuss a connection between stationary solutions of these equations and symplectic topology, as well as possible...

An error-correcting code is called locally decodable if there exists a decoding algorithm that can recover any symbol of the message with high probability by reading only a small number of symbols of the corrupted codeword. There is a fundamental...

I will present results on the study of various temporal correlation functions of a tagged particle in a one-dimensional system of interacting particles evolving with Hamiltonian dynamics and with initial conditions chosen from thermal equilibrium.

Boltzmann defined the entropy, \(S(M)\), of a macroscopic system in a macrostate \(M\) as the "log of the volume of phase space" corresponding to the system being in \(M\). This definition was extended by von Neumann to quantum systems as "the log...

In the 90's numerical simulations have unveiled interesting properties of random ensembles of constraint satisfaction problems (satisfiability and graph coloring in particular). When a parameter of the ensemble (the density of constraints per...

The (weakly) self-avoiding walk is a basic model of paths on the d-dimensional integer lattice that do not intersect (have few intersections), of interest from several different perspectives. I will discuss a proof that, in dimension 4, the...