Previous Conferences & Workshops

This will be a survey of old and new problems and results in additive number theory.

We show that random sparse binary linear codes are locally testable and locally decodable (under any linear encoding) with constant queries (with probability tending to one). By sparse, we mean that the code should have only polynomially many...

In this work we construct explicit deterministic extractors from polynomial sources, namely from distributions sampled by low degree multivariate polynomials over finite fields. This naturally generalizes previous work on extraction from affine...

In the beginning we review the classical method of computing the cohomology of PEL-type Shimura varieties with good reduction modulo p, and explain the tools that are useful for studying the bad reduction of compact Shimura varieties. Then we...

It is an introduction to the topic. We would present several inverse theorems in additive number theory (starting with Freiman's) and some overview about their applications. Next, we discuss the connection between some of these and problems...