N3.12

A word w has finite width n in a group G if each element in the subgroup generated by the w-values in G can be written as the product of at most n w-values. A group G is called verbally elliptic if every word has finite width in G. In this talk I will present a proof for the fact that every finitely generated virtually nilpotent group is verbally elliptic.

"Show that there is a function $f$ such that for any sequence $(x_1, x_2, \dots)$ we have $x_n = f(x_{n + 1}, x_{n + 2}, \dots)$ for all but finitely many $n$."

Fred Galvin. Problem 5348. The American Mathematical Monthly, 72(10):p. 1135, 1965.\\

This quote is one of the earliest examples of an infinite hat problem, although it's not phrased this way. A hat problem is a non-empty set of colours together with a directed graph, where the nodes correspond to "agents" or "players" and the edges determine what the players "see". The goal is to find a collective strategy for the players which ensures that no matter what "hats" (= colours) are placed on their heads, they will ensure that a "sufficient" amount guess correctly.\\

In this talk I will discuss hat problems on countable sets and show that in a non-transitive setting, the relationship between existence of infinitely-correct strategies and Ramsey properties of the graph breakdown, in the particular case of the parity game. I will then introduce some small cardinals (uncountable cardinals no larger than continuum) that will be useful in analysing the parity game. Finally, I will present some new results on the sigma-ideal of meagre sets of reals that arise from this analysis.

Riley and Dison's hydra groups are a family of group and subgroup pairs $(G_k, H_k)$ for which the subgroup $H_k$ has distortion like the $k$-th Ackermann function. One wants to know if finite quotients can distinguish elements that are not in $H_k$, as a positive answer would allow you to construct a hands-on family of finitely presented, residually finite groups with arbitrarily large Dehn functions. I'll explain why we get a negative answer.

In the late 70s -- early 80s Makanin came up with a very simple, but very powerful idea to approach solving equations in free groups. This simplicity makes Makanin-like procedures ubiquitous in mathematics: in dynamical systems, geometric group theory, 3-dimensional topology etc. In this talk I will explain loosely how Makanin's algorithm works.

The Haagerup property is a group theoretic property which is a strong converse of Kazhdan's property (T). It implies the Baum-Connes conjecture and has connections with amenability, C*-algebras, representation theory and so on. It is thus not surprising that quite some effort was made to investigate how the Haagerup property behaves under the formation of free products, direct products, direct limits,... In joint work with Y.Antolin, we investigated the behaviour of the Haagerup property under graph products. In this talk we introduce the concept of a graph product, we give a gentle introduction to the Haagerup property and we discuss its behaviour under graph products.