Previous Conferences & Workshops

We show that for every positive integer k there are positive constants C and c such that if A is a subset of {1, 2, ..., n} of size at least C n^{1/k}, then, for some d \leq k-1, the set of subset sums of A contains a homogeneous d-dimensional...

Randomness is a vital resource in computation, with many applications in areas such as cryptography, data-structures and algorithm design, sampling, distributed computing, etc. However generating truly random bits is expensive, and most sources in...

Borel proved that any holomorphic map from an affine complex algebraic curve to a Shimura variety (with sufficient level structure) must be algebraic. We will discuss a p-adic analogue of this theorem. This is joint work with Abhishek Oswal and...

A quasigeodesic in a manifold is a curve so that when lifted to the universal cover is uniformly efficient up to a bounded multiplicative and added error in measuring length. A flow is quasigeodesic if all flow lines are quasigeodesics. We prove...

In the minimum cost set cover problem, a set system is given as input, and the goal is to find a collection of sets with minimum cost whose union covers the universe. This NP-hard problem has long been known to admit logarithmic approximations...

Ever since Furstenberg proved his multiple recurrence theorem, the limiting behaviour of multiple ergodic averages along various sequences has been an important area of investigation in ergodic theory. In this talk, I will discuss averages along...

Abstract: A version of the polynomial Szemer´edi theorem was shown to hold in finite fields in [BLM05]. In particular, one has patterns

${x, x + P1(n), . . . , x + Pk(n)}$ (1)

for polynomials with zero constant term in large subsets of finite...

Abstract: The works of Furstenberg and Bergelson-Leibman on the Szemeredi theorem and its polynomial extension motivated the study of the limiting behavior of multiple ergodic averages of commuting transformations with polynomial iterates. Following...