Abstract: I will discuss applications of algebraic results to combinatorics, focusing in particular on Lefschetz theorem, Decomposition theorem and Hodge Riemann relations. Secondly, I will discuss proving these results combinatorially, using a technique by McMullen and extended by de Cataldo and Migliorini. Finally, I will discuss Lefschetz type theorems beyond positivity. Recommended prerequisites: basic commutative algebra

Abstract: Modular forms are historically the first example of automorphic forms, and are still studied today as they have many applications. In this talk I want to introduce modular forms, give some examples, and, if time permits, explain the connection to elliptic curves, objects we already met in the first lecture.

Krieger’s generator theorem shows that any free invertible ergodic measure preserving action (Y,\mu, S) can be modelled by A^Z (equipped with the shift action) provided the natural entropy constraint is satisfied; we call such systems (here it is A^Z) universal. Along with Tom Meyerovitch, we establish general specification like conditions under which Z^d-dynamical systems are universal. These conditions are general enough to prove that 1) A self-homeomorphism with almost weak specification on a compact metric space (answering a question by Quas and Soo)

 Automorphisms of meet-trees


Abstract: A meet-tree is a partial order such that the set of vertices below any vertex is linearly ordered, and for every pair of vertices there is a greatest element smaller than or equal to each of them. I'll talk on a work in progress with Itay Kaplan and Tomasz Rzepecki mainly showing that the universal homogeneous countable meet-tree admits generic automorphisms.