Firstly, we will discuss how the category of strict polynomial functors can be endowed with a monoidal structure, including concrete calculations. It is well-known that the above category is equivalent to the category of modules over the Schur algebra. The so-called Schur functor in turn relates the category of modules over the Schur algebra to the category of representations of the symmetric group which posseses a monoidal structure given by the Kronecker product. We show that the Schur functor is monoidal with respect to these structures.
Finally, we consider the right and left adjoints of the Schur functor. We explain how these can be expressed in terms of one another using Kuhn duality and the central role the monoidal structure on strict polynomial functors plays in this context.
 

 If you fix a class of models and a construction method that allows you to construct a new model in that class from an old model in that class, you can consider the Kripke frame generated from any given model by iterating that construction method and define the modal logic of that Kripke frame.  We shall give a general definition of these modal logics in the fully abstract setting and then apply these ideas in a number of cases.  Of particular interest is the case where we consider the class of models of ZFC with the construction method of forcing:  in this case, we are looking at the so-called "generic multiverse".

Quasihomomorphisms (QHMs) are maps $f$ between groups such that the
homomorphic condition is boundedly satisfied. The case of QHMs with
abelian target is well studied and is useful for computing the second
bounded cohomology of groups. The case of target non-abelian has,
however, not been studied a lot.

We will see a technique for classifying QHMs $f: G \rightarrow H$ by Fujiwara and
Kapovich. We will give examples (sometimes with proofs!) for QHM in
various cases such as

• the image $H$  hyperbolic groups,
• the image $H$ discrete rank one isometries,
• the preimage $G$ cyclic / free group, etc.

Furthermore, we point out a relation between QHM and extensions by short
exact sequences.

A family of expanders is a sequence of finite graphs which are both sparse and highly connected. Firstly defined in the 80s, they had huge applications in applied maths and computer science. Moreover, it soon turned out that they also had deep implications in pure maths. In this talk I will introduce the expander graphs and I will illustrate a way to construct them by approximating actions of groups on probability spaces.