Reading Seminar - Winter 2017/2018

Topics in combinatorics and computer science


Main

Research

Courses




This activity is sponsored by ERC-2014- CoG AUTAR (grant agreement ERC-2014-CoG 648276 AUTAR)





Previous reading groups:

Spring 2016 (General content)

Winter 2016 (graph expanders)

Spring 2017 (Graph limits)

If it is not stated the opposite, we will meet at meet at the seminar room at C3

What we have seen so far...

When/ Where

What

Who

17/10/17- Seminar room C3

Asymptotic Erdos-Szekeres: Zuk's proof

Juanjo Rué

24/10/17- Seminar room C3

Algebraic Methods in Discrete Analogs of the Kakeya Problem

Simeon Ball

31/10/17

The cap set problem

Christoph Spiegel

07/11/17: No session!

14/11/17

A tight bound for Green’s arithmetic triangle removal lemma in vector spaces

Maximilian Wötzel

21/11/17

Protected nodes and fringe subtrees in some random trees

Vasiliki Velona

28/11/17

On sets with small sumset in the circle

Pablo Candela

04-05 December: two sessions of the differential Equation Method by Gonzalo Fiz

Session 1: Monday 4 from 11:15 to 13:00

Session 2: Tuesday 5 from 14:00 to 16:00

11/12/17

Hypergraph expanders from Cayley graphs

Oriol Serra