Previous Conferences & Workshops

A sequence of primes p_1, ..., p_k is called a prime chain if p_j | (p_{j+1}-1) for each j ; e.g. 3, 7, 29, 59. We will discuss problems about counting prime chains with certain properties, and about the existence of prime chains with various...

We construct a weak representation of the category of framed affine tangles on a disjoint union of triangulated categories $D_n$. The categories we use are that of coherent sheaves on Springer fibers over a nilpotent element of $SL(2n)$ with two...

In this talk we will examine some computational problems related to polynomials, namely: (i) Given a polynomial, can we make a linear transformation on the variables and write it as the sum of two independent polynomials. (ii) Is a given set of...

A given function f(x) is "hard on average" with respect to an algorithm A , if A(x) disagrees with f(x) on "many" inputs x. Applications in cryptography and derandomization require functions that are "very hard on average" (essentially unpredictable...

In my talk I will describe our joint work with David Kazhdan on the global Langlands correspondence over function fields for arbitrary split reductive groups. Our main result asserts that for every pair $(\pi,\omega)$, where $\pi$ is a cuspidal...

For a general L-function, the bound on its critical line obtained by applying the Phragmen-Lindeloff interpolation method is called the convexity bound. Any bounds with a power saving of the convexitybound are called subconvexity bounds. In this...