Past Events

We consider a gradient Gibbs measure with non convex potential and show that it behaves at high temperature like a gaussian free field. The proof is based on the fact that the marginal distribution of the even sites has a strictly convex Hamiltonian...

The study of localized waves has a long history dating back to the discoveries in the 1800s by Russell, Boussinesq and Korteweg-deVries(KdV) describing water waves in shallow water. In the 1960s researchon the KdV equation led to the concept of...

Given n points in the real plane, the unit distance problem asks for an asymptotic upper bound on the number of unit distances between pairs of the points. We consider this problem under the restriction that the line segments between the points make...

The classical method of moving frames was developed by Elie Cartan into a powerful tool for studying the geometry of submanifolds under certain geometrical transformation groups. In this talk, I will present a new foundation for moving frame theory...

In my thesis, I give a new construction of the tame local Langlands correspondence for GL(n,F), n a prime. The Local Langlands Correspondence for GL(n,F) has been proven recently by Henniart, Harris/Taylor. In the tame case, supercuspidal...

I discuss a scheme of fault-tolerant quantum computation which is driven by local projective measurements on an entangled quantum state of many qubits, a so-called cluster state. There are two fundamentally different ways of evolving quantum states...

Microtubules are intracellular polymers that dynamically grow and shorten at their ends via the stochastic addition and loss of αβ-tubulin heterodimers, a highly regulated process that underlies many fundamental cellular processes, including...

In this talk, we will discuss several optimal (global) conditions for the existence of a smooth solution to the mean curvature flow. Our focus will be on quantities involving only the mean curvature. We will also discuss several applications of a...

The conjugate gradient (CG) algorithm is usually the method of choice for the solution of large symmetric positive definite linear systems Ax=b. If however the matrix-vector products Av required at each iteration can not be calculated accurately, the...

I discuss algorithms and complexity results for two game theoretic extensions of integer programming: integer programming games and bilevel integer programming. In the case of integer programming games, I discuss an algorithm which computes pure Nash...