2018 Apr 16

# Special talk: Yonatan Harpaz (Paris 13) - "Towards a universal property for Hermitian K-theory"

## Lecturer:

Yonatan Harpaz (Paris 13)
4:30pm to 5:30pm

## Location:

Ross 70

Abstract: Hermitian K-theory can be described as the "real" analogue of algebraic K-theory, and plays a motivic role similar to the role played by real topological K-theory in classical stable homotopy theory. However, the abstract framework surrounding and supporting Hermitian K-theory is less well understood than its algebraic counterpart, especially in the case when 2 is not assumed to be invertible in the ground ring.

2018 Jun 27

# Analysis Seminar: Barry Simon (Caltech) "Heinävarra’s Proof of the Dobsch–Donoghue Theorem"

12:00pm to 1:00pm

## Location:

Ross Building, Room 70
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.
2018 May 29

# Yuri Lima (Paris 11): Symbolic dynamics for non-uniformly hyperbolic systems with singularities

2:15pm to 3:15pm

## Location:

Ross 70
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.
2018 May 08

# Dynamics Seminar: Yinon Spinka (TAU): Finitary codings of Markov random fields

2:15pm to 4:15pm

## Location:

Ross 70
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.
2018 Apr 12

# Special talk: Yonatan Harpaz (Paris 13) - "Small extensions in algebra and topology"

## Lecturer:

Yonatan Harpaz (Paris 13)
1:15pm to 2:15pm

## Location:

Ross 70
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
2018 Apr 16

# HD-Combinatorics Special Day on Grassman Expanders and Unique Games (organized by Irit Dinur)

(All day)

## Location:

Room 130, IIAS, Feldman Building, Givat Ram
2018 Apr 11

4:00pm to 6:00pm

Ross 70A
2018 Apr 15

# GAME THEORY AND MATHEMATICAL ECONOMICS RESEARCH SEMINAR: Ron Peretz, Bar Ilan University: "The Rate of Innovation Diffusion in Social Networks (joint with Itai Arieli, Yakov Babichenko, and Peyton H Young)"

1:30pm to 2:30pm

## Location:

Elath Hall, 2nd floor, Feldman Building, Edmond Safra Campus
2018 May 22

# Dynamics Lunch: Tsviqa Lakrec (Huji)

12:00pm to 1:00pm

## Location:

Manchester lounge
2017 May 29

# Logic seminar - Ur Yaar, "A Toy Multiverse"

2:00pm to 4:00pm

## Location:

Shprinzak 101
We will present briefly the "multiverse view" of set theory, advocated by Hamkins, that there are a multitude of set-theoretic universes, and not one background universe, and his proposed "Multiverse Axioms". We will then move on to present the main result of Gitman and Hamkins in their paper "A natural model of the multiverse axioms" - that the countable computably saturated models of ZFC form a "toy model" of the multiverse axioms.
2018 Apr 11

# Logic Seminar - Shahar Oriel - "The infinite random simplicial complex"

11:00am to 1:00pm

## Location:

Ross 63
This talk will be a review of a paper by Andrew Brooke-Taylor and Damiano Testa
2017 Mar 01

# Logic seminar - Yair Hayut, "Weak Prediction Principles"

4:00pm to 6:00pm

## Location:

Ross 70
Weak Prediction Principles Speaker: Yair Hayut Abstract: Jensen's diamond is a well studied prediction principle. It holds in L (and other core models), and in many cases it follows from local instances of GCH. In the talk I will address a weakening of diamond (due to Shaleh and Abraham) and present Abraham's theorem about the equivalence between weak diamond and a weak consequence of GCH. Abraham's argument works for successor cardinals. I will discuss what is known and what is open for inaccessible cardinals. This is a joint work with Shimon Garti and Omer Ben-Neria.
2017 Nov 29

# Logic Seminar - Isabel Muller - "Zil'bers Conjecture and Building-like Geometries"

11:00am to 1:00pm

In an attempt to classify the geometries arising in strongly minimal sets, Zil'ber conjectured them to split into three different types: Trivial geometries, vector space-like geometries and field-like geometries. Soon after, Hrushovski refuted this conjecture while introducing a new construction method, which has been modified and used a lot ever since.
2018 May 09

# Logic Seminar - Immanuel Benporat - "Arbault sets"

11:00am to 1:00pm

## Location:

Ross 63
Arbault sets (briefly, A-sets) were first introduced by Jean Arbault in the context of Fourier analysis. One of his major results concerning these sets,asserts that the union of an A-set with a countable set is again an A-set. The next obvious step is to ask what happens if we replace the word "countable" by א_1. Apparently, an א_1 version of Arbault's theorem is independent of ZFC. The aim of this talk would be to give a proof (as detailed as possible) of this independence result. The main ingredients of the proof are infinite combinatorics and some very basic Fourier analysis.
2015 Nov 11

# Logic seminar

Repeats every week every Wednesday until Tue Mar 28 2017 except Wed Nov 11 2015.
4:00pm to 6:00pm

4:00pm to 6:00pm
4:00pm to 6:00pm
4:00pm to 6:00pm
4:00pm to 6:00pm
4:00pm to 6:00pm
4:00pm to 6:00pm
4:00pm to 6:00pm
4:00pm to 6:00pm
4:00pm to 6:00pm
4:00pm to 6:00pm
4:00pm to 6:00pm
4:00pm to 6:00pm
4:00pm to 6:00pm
4:00pm to 6:00pm
4:00pm to 6:00pm
4:00pm to 6:00pm
4:00pm to 6:00pm
4:00pm to 6:00pm
4:00pm to 6:00pm
4:00pm to 6:00pm
4:00pm to 6:00pm
4:00pm to 6:00pm
4:00pm to 6:00pm
4:00pm to 6:00pm
4:00pm to 6:00pm
4:00pm to 6:00pm
4:00pm to 6:00pm
4:00pm to 6:00pm
4:00pm to 6:00pm
4:00pm to 6:00pm
4:00pm to 6:00pm
4:00pm to 6:00pm
4:00pm to 6:00pm
4:00pm to 6:00pm
4:00pm to 6:00pm
4:00pm to 6:00pm
4:00pm to 6:00pm
4:00pm to 6:00pm
4:00pm to 6:00pm
4:00pm to 6:00pm
4:00pm to 6:00pm
4:00pm to 6:00pm
4:00pm to 6:00pm
4:00pm to 6:00pm
4:00pm to 6:00pm
4:00pm to 6:00pm
4:00pm to 6:00pm
4:00pm to 6:00pm
4:00pm to 6:00pm
4:00pm to 6:00pm
4:00pm to 6:00pm
4:00pm to 6:00pm
4:00pm to 6:00pm
4:00pm to 6:00pm
4:00pm to 6:00pm
4:00pm to 6:00pm
4:00pm to 6:00pm
4:00pm to 6:00pm
4:00pm to 6:00pm
4:00pm to 6:00pm
4:00pm to 6:00pm
4:00pm to 6:00pm
4:00pm to 6:00pm
4:00pm to 6:00pm
4:00pm to 6:00pm
4:00pm to 6:00pm
4:00pm to 6:00pm
4:00pm to 6:00pm
4:00pm to 6:00pm
4:00pm to 6:00pm
4:00pm to 6:00pm

## Location:

Ross 70
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