Abstract: (joint with Noam Aigerman, Raz Sluzky and Yaron Lipman)

The Mass Transport Principle is a useful technique that was introduced to the study of automorphism-invariant percolations by Häggström in 1997. The technique is a sort of mass conservation principle, that allows us to relate random properties (such as the random degree of a vertex) to geometric properties of the graph. I will introduce the principle and the class of unimodular graphs on which it holds, as well as a few of its applications.

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

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.

Keisler measures were introduced in the late 80's by Keisler but they became central objects in model theory only recently with the development of NIP theories. This led naturally to the question of whether there might be a parallel theory of measures in other tame classes, especially in the simple theories where pseudofinite counting measures supply natural and interesting examples. We will describe some first steps toward establishing such a theory, based on Keisler randomizations and the theory of independence for NSOP1 theories in continuous logic.