Previous Conferences & Workshops

In this talk, we discuss a new technique which shows how to find a copy of a sparse bipartite graph in a graph of positive density. Our results imply several new bounds for classical problems in Ramsey theory and improve and generalize earlier...

A network creation game abstracts a network construction by selfish agent who build a network by buying links to each other. Each player pays a fixed cost per link, and suffers an additional communication cost (which is the sum of distances to the...

We study systems of linear ordinary differential equations dy/dz=A(z)y, where A is a matrix-valued rational function of z. By definition, such equation is rigid if it is uniquely determined by the type of its singularities. Our goal is to provide a...

The aim is to present some of the more technical aspects of my joint project with Tim Gowers regarding the true complexity of a system of linear quations. Using so-called "quadratic Fourier analysis", we determined a necessary and sufficient...