Abstract: In 1934, Loewner proved a remarkable and deep theorem about matrix monotone functions. Recently, the young Finnish mathematician, Otte Heinävarra settled a 10 year old conjecture and found a 2 page proof of a theorem in Loewner theory whose only prior proof was 35 pages. I will describe his proof and use that as an excuse to discuss matrix monotone and matrix convex functions including, if time allows, my own recent proof of Loewner’s original theorem.

Symbolic dynamics is a tool that simplifies the study of dynamical systems in various aspects. It is known for almost fifty years that uniformly hyperbolic systems have ``good'' codings. For non-uniformly hyperbolic systems, Sarig constructed in 2013 ``good'' codings for surface diffeomorphisms. In this talk we will discuss some recent developments on Sarig's theory, when the map has discountinuities and/or critical points, such as multimodal maps of the interval and Bunimovich billiards.

Let X be a stationary Z^d-process. We say that X is a factor of an i.i.d. process if there is a (deterministic and translation-invariant) way to construct a realization of X from i.i.d. variables associated to the sites of Z^d. That is, if there is an i.i.d. process Y and a measurable map F from the underlying space of Y to that of X, which commutes with translations of Z^d and satisfies that F(Y)=X in distribution. Such a factor is called finitary if, in order to determine the value of X at a given site, one only needs to look at a finite (but random) region of Y.

Abstract: In this talk, we will discuss the notion of small extensions in its various incarnations, from torsors under abelian groups to square-zero extensions of algebras. We will then focus on the somewhat less familiar case of small extensions of ∞-categories. Our main goal is to make this abstract concept concrete and intuitive through a variety of examples. In particular, we will advocate the point of view that small extensions of  ∞-categories offer a unifying perspective in understanding many constructions appearing in obstruction, classification, and deformation theoretic problems

Reflections on the coloring and chromatic numbers Speaker: Chris Lambie-Hanson Abstract: Compactness phenomena play a central role in modern set theory, and the investigation of compactness and incompactness for the coloring and chromatic numbers of graphs has been a thriving area of research since the mid-20th century, when De Bruijn and Erdős published their compactness theorem for finite chromatic

Zilber introduced quasi-minimal classes to generalize the model theory of pseudo exponential fields. They are equipped with a pregeometry operator and satisfy interesting properties such as having only countable or co-countable definable sets. Differentially closed fields of characteristic 0, rich examples of a \omega-stable structures, are good candidates to be quasiminimal. The difficulty is that a differential equation may have uncountably many solutions, and thus violate the countable closure requirement of quasiminimal structures.

We shall prove that there is a sequence of Boolean algebras for which the ultraproduct of the lengths divided by an ultrafilter is strictly less than the length of the product algebra. This is a joint work with Saharon Shelah.

Abstract: In this talk I will discuss some suitable definable Bohr compactification of an ultraproduct of finite groups, and relate it to ultra quasirandom groups.

Abstract: Paul Larson proved that under Martin's axiom and large continuum there are no Laver ideals over aleph_1. He asked about weakly Laver ideals under some forcing axiom. We shall address two issues: 1. Under Martin's axiom and the continuum is above aleph_2, there are no weakly Laver ideals over aleph_1.. 2. Under Baumgartner's axiom, the parallel of Larson's theorem holds for ideals over aleph_2.

Speaker: Elad Levi Algebraic regularity lemma for hypergraphs Abstract: Szemer´edi’s Regularity Lemma is a fundamental tool in graph theory. It states that for every large enough graph, the set of vertices has a partition A1,..,Ak, such that for almost every two subsets Ai,Aj the induced bipartite graph on (Ai,Aj) is regular, i.e. similar to a random bipartite graph up to a given error.