This year's Paul Turán Memorial Lectures will be delivered by

titled

- The lectures are organized by the János Bolyai Mathematical Society
and will take place

February 18th, 2pm:

February 19th, 2pm:

Questions and tools in Combinatorial Number Theory are intimately connected to problems and techniques in Graph Theory. This tight relation will appear in each of the lectures.

The first lecture sketches several applications of probabilistic ideas in Combinatorics and Additive Number Theory, showing that a probabilistic point of view may be helpful even when we are interested only in purely deterministic mathematical statements or in purely deterministic algorithms.

The second lecture demonstrates how elementary properties of polynomials can be applied in deriving results in Number Theory and Graph Theory including the investigation of sumsets in finite fields and the study of the finite field Kakeya Problem.

The third lecture deals with the structure of large graphs, whose study combines tools from additive combinatorics and Extremal Graph Theory with probabilistic, geometric and analytic tools.