Previous Conferences & Workshops

One of the principal questions about L-functions is the size of their critical values. In this talk, we will present a new subconvexity bound for the central value of a Dirichlet L-function of a character to a prime power modulus, which breaks a...

A property of finite graphs is called nondeterministically testable if it has a "certificate'' such that once the certificate is specified, its correctness can be verified by random local testing. In this talk we consider certificates that consist...

The goal of the Balanced Separator problem is to find a balanced cut in a given graph G(V,E), while minimizing the number of edges that cross the cut. It is a fundamental problem with applications in clustering, image segmentation, community...

I will report some recent progress in the study of local models of Shimura varieties, including the proof of the coherence conjecture of Pappas-Rapoport and the Kottwitz conjecture

We study the list-decodability of multiplicity codes. These codes, which are based on evaluations of high-degree polynomials and their derivatives, have rate approaching 1 while simultaneously allowing for sublinear-time error-correction. In this...

Heegaard Floer homology groups were recently introduced by Ozsvath and Szabo to study properties of 3-manifolds and knots in them. The definition of the invariants rests on delicate holomorphic geometry, making the actual computations cumbersome. In...

Consider the problem when we want to construct some structure on a bounded degree graph, e.g. an almost maximum matching, and we want to decide about each edge depending only on its constant radius neighborhood. We show that the information about...

This talk will be about some new tools based on model theory that could be useful in the study of harmonic analysis on reductive p-adic groups. In 2008, R. Cluckers and F. Loeser defined the class of the so-called "constructible motivic exponential...