# Eventss

# GAME THEORY AND MATHEMATICAL ECONOMICS RESEARCH SEMINAR:Michal Feldman, Tel Aviv University "Interdependent Values without Single-Crossing (Joint work with Alon Eden, Amos Fiat and Kira Goldner)"

## Location:

Abstract:

We consider a setting where an auctioneer sells a single item to n potential agents with {\em interdependent values}. That is, each agent has her own private signal, and the valuation of each agent is a function of all n private signals. This captures settings such as valuations for oil fields, broadcast rights, art, etc. Read more about GAME THEORY AND MATHEMATICAL ECONOMICS RESEARCH SEMINAR:Michal Feldman, Tel Aviv University "Interdependent Values without Single-Crossing (Joint work with Alon Eden, Amos Fiat and Kira Goldner)"

# Special Talk : Justin Noel (University of Regensburg) - "Blue-shift and thick tensor ideals"

## Lecturer:

## Location:

Abstract:

I will discuss a recent generalization of Kuhn's Blue-shift theorem about Tate cohomology. Combining this result with work of Arone, Dwyer, and Lesh we resolve a conjecture of Balmer and Sanders and classify the thick tensor ideals of compact genuine $A$-spectra, where $A$ is a finite abelian group. This is joint work with Tobias Barthel, Markus Hausmann, Niko Naumann, Thomas Nikolaus, and Nathaniel Stapleton.

# Dynamics Seminar: Tsviqa Lakrec (Huji)

## Location:

Look at the sequence of the first $N$ steps taken and colors of the visited locations.

From it, you can deduce the coloring of approximately $\sqrt{N}$ integers.

Suppose an adversary may change $\delta N$ entries in that sequence. What can be deduced now?

We show that for any $\theta<0.5,p>0$, there are $N_{0},\delta_{0}$

such that if $N>N_{0}$ and $\delta<\delta_{0}$ then with probability $>1-p$ we can reconstruct

# Tomasz Rzepecki (Uniwersytet Wrocławski): Topological dynamics and Galois groups in model theory

## Location:

I will briefly recall the required notions from topological dynamics. Some knowledge of model theory will help to understand the motivations, but otherwise, it will not be necessary.

# Basic Notions: Alex Lubotzky "From expander graphs to high dimensional expanders: a road map"

## Location:

# Analysis Seminar: Nadav Dym (WIS) "Linear algorithms for computing conformal mappings"

## Location:

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

# Dynamics Lunch: Matan Seidel (Huji) - "The Mass Transport Principle in Percolation Theory"

## Location:

I will introduce the principle and the class of unimodular graphs on which it holds, as well as a few of its applications.

# Dvoretzky Lectures 2018: Alexei Borodin (MIT)

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

## Lecturer:

## Location:

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. Read more about Special talk: Yonatan Harpaz (Paris 13) - "Towards a universal property for Hermitian K-theory"

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

## Location:

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.

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

## Location:

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

## Location:

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.