2016
May
31

# Dynamics lunch: Yuri Kifer (HUJI) - On Erdos-Renyi law of large numbers and its extensions

12:00pm to 1:00pm

## Location:

Manchester building, Hebrew University of Jerusalem, (Coffee lounge)

- 2016 May 31
# Dynamics lunch: Yuri Kifer (HUJI) - On Erdos-Renyi law of large numbers and its extensions

12:00pm to 1:00pm## Location:

Manchester building, Hebrew University of Jerusalem, (Coffee lounge) - 2016 May 17
# Dynamics lunch: Elon Lindenstrauss (HUJI) - Bilu's theorem

12:00pm to 1:00pm## Location:

Manchester building, Hebrew University of Jerusalem, (Coffee lounge)I will describe Bilu's equidistribution theorem for roots of polynomials, and explain some implications this has on entropy of toral automorphisms. - 2016 May 10
# Dynamics lunch: Ori Gurel Gurevitch (HUJI), Stationary random graphs

12:00pm to 1:00pm## Location:

Manchester building, Hebrew University of Jerusalem, (Coffee lounge) - 2016 Apr 05
# Dynamics lunch: Shahar Mozes (HUJI) - Margulis inequalities

12:00pm to 1:00pm## Location:

Manchester building, Hebrew University of Jerusalem, (Coffee lounge) - 2016 Mar 29
- 2016 Mar 22
- 2016 Mar 15
- 2016 Mar 08
# Dynamics lunch seminar: Brandon Seward (HUJI): Entropy theory for non-amenable groups (part I)

12:00pm to 1:45pm## Location:

Ross 70Entropy was first defined for actions of the integers by Kolmogorov in 1958 and then extended to actions of countable amenable groups by Kieffer in 1975. Recently, there has been a surge of research in entropy theory following groundbreaking work of Lewis Bowen in 2008 which defined entropy for actions of sofic groups. In this mini-course I will cover these recent developments. I will carefully define the notions of sofic entropy (for actions of sofic groups) and Rokhlin entropy (for actions of general countable groups), discuss many of the main results, and go through some of the proofs. - 2016 Jan 12
# Dynamics lunch: Brandon Seward (HUJI), "Borel chromatic numbers of free groups"

12:00pm to 1:00pm## Location:

Manchester building, Hebrew University of Jerusalem, (Coffee lounge)Borel chromatic numbers of free groups Abstract: Recall that a coloring of a graph is a labeling of its vertices such that no pair of vertices joined by an edge have the same label. The chromatic number of a graph is the smallest number of colors for which there is a coloring. If G is a finitely generated group with generating set S, then for any free action of G on a standard Borel space X, we can place a copy of the S-Cayley graph of G onto every orbit. This results in a graph whose vertex set is X and whose edge set is Borel measurable. We can then consider Borel - 2016 Jan 05
# Dynamics lunch: Sebastian Donoso (HUJI) - Automorphism groups of low complexity subshifts

12:00pm to 1:00pm## Location:

Manchester building, Hebrew University of Jerusalem, (Coffee lounge)Abstract: The automorphism group of a subshift $(X,\sigma)$ is the group of homeomorphisms of $X$ that commute with $\sigma$. It is known that such groups can be extremely large for positive entropy subshifts (like full shifts or mixing SFT). In this talk I will present some recent progress in the understanding of the opposite case, the low complexity one. I will show that automorphism groups are highly constrained for low complexity subshifts. For instance, for a minimal subshifts with sublinear complexity the automorphism group is generated by the shift and a finite set.