Ergodic Theory and Combinatorics Conference University of Agder, Kristiansand
June 8 - 12, 2015
Abstracts of the talks
Tim Austin, Courant Institute, USA
Multiple recurrence and Ajtai-Szemeredi Theorems for products of groups.
I will sketch two recent and somewhat analogous pieces of work: a generalization of the Furstenberg-Katznelson Theorem to commuting actions of an amenable group, and genera- lizations of the Ajtai-Szemeredi Theorem to the Cartesian square of a quasirandom group. The first answers a question of Bergelson, and the second gives a quantitative version of some recent results of Bergelson, Robertson and Zorin-Kranich. The second work also pro- ves a new Ajtai-Szemeredi-type theorem, for which an ergodic theoretic analog is unclear.
Mathias Beiglb¨ock, University of Vienna, Austria
Cyclical monotonicity and the ergodic theorem
A fundamental concept in the field of mass transport is the notion of cyclical monotoni- city: it provides a combinatorial characterization of optimal transport plans which is key to understanding the geometry of mass transport. We explain how this link between op- timality and its combinatorial counterpart can be understood through the ergodic theorem.
1 Daniel Berend, Ben-Gurion University, Israel
Reconstruction of Domino Tilings (joint with Yoav Bar-Sinai)