Previous Conferences & Workshops

We will discuss the introduction of the scattering operators associated with a conformal manifold by Graham and Zworski. Then we will discuss some uses of such family of operators in describing conformally invariant global quantities for conformal...

The goal of this course to provide an introduction to Monge-Ampere-type equations in conformal geometry and their applications. The plan of the course is the following: After providing some background material in conformal geometry, I will describe...

A celebrated theorem of Razborov/Smolensky says that constant depth circuits comprising AND/OR/MOD_{p^k} gates of unbounded fan-in, require exponential size to compute the MAJORITY function if p is a fixed prime and k is a fixed integer. Extending...

Color Coding is an algorithmic technique for deciding efficiently if a given input graph contains a path of a given length (or another small subgraph of a certain type). It illustrates well the phenomenon that probabilistic reasoning can be helpful...

We present the first local list-decoding algorithm for the r-th order Reed-Muller code RM(r,m) over F_2 for r>1 . Given an oracle for a received word R: F_2^m to F_2 , our randomized local list-decoding algorithm produces a list containing all...

In this talk, I will explain how the method originally developed by Ihara, Langlands and Kottwitz to compute the cohomology of a Shimura variety (use the Grothendieck-Lefschetz fixed point formula in positive characteristic to calculate the trace on...

The fundamental lemma of Langlands and Shelstad is a family of combinatorial identities between local orbital integrals. It is necessary to the stabilization of the elliptic part of the Arthur-Selberg trace formula. In order to stabilize the whole...

In a first part, we shall prove a quantitative nonvanishing result conjectured by Ph .Michel and A .Venkatesh which concerns the special derivatives occurring in the Gross-Zagier formula. Our method relies on two classical equidistribution Theorems...

In this talk I will discuss the construction of blowing up solutions to the Yamabe Problem in high dimensions. I will show how one can use the methods of S. Brendle to produce smooth counterexamples to the Weyl Vanishing Conjecture also.

The topic of this short talk is based on the following natural question: Given a polynomial f (for example, f is the Determinant of a matrix), what is the best way to compute this polynomial? We will start by the very basic definitions: what does it...