Previous Conferences & Workshops

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...

It is an introduction to the topic. We would present a proof of the quantitative sum-product in F^p and the proof of the exponential sum bound + an overview of what's around.

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...