2016 Jun 21

# Dynamics & probability: Fedor Pakovitch - On semiconjugate rational functions

2:00pm to 3:00pm

## Location:

Manchester building, Hebrew University of Jerusalem, (Room 209)
Let $A$, $B$ be two rational functions of degree at least two on the Riemann sphere. The function $B$ is said to be semiconjugate to the function $A$ if there exists a non-constant rational function $X$ such that the equality (*) A\circ X=X\circ B holds. The semiconjugacy relation plays an important role in the classical theory of complex dynamical systems as well as in the new emerging field of arithmetic dynamics. In the talk we present a description of solutions of (*) in terms of two-dimensional orbifolds of non-negative Euler characteristic on the Riemann sphere.
2016 May 31

# Dynamics & probability: Adi Glücksam (TAU): Translation invariant probability measures on the space of entire functions

2:00pm to 3:00pm

## Location:

Manchester building, Hebrew University of Jerusalem, (Room 209)
20 years ago Benjy Weiss constructed a collection of non-trivial translation invariant probability measures on the space of entire functions. In this talk we will present a construction of such a measure, and give upper and lower bounds for the possible growth of entire functions in the support of such a measure. We will also discuss "uniformly recurrent" entire functions, their connection to such constructions, and their possible growth. The talk is based on a joint work with Lev Buhovski, Alexander Loganov, and Mikhail Sodin.
2016 Apr 05

# Dynamics & probability: Grisha Derfel (BGU): “Diffusion on fractals and the Poincare's functional equation"

2:00pm to 3:00pm

## Location:

Manchester building, Hebrew University of Jerusalem, (Room 209)
We give a brief overview on applications of the Poincare's equation to the study of random walk on the the Sierpi ́nski gasket. In particular, we discuss such questions as anomalous diffusion, relation to branching processes and decimation invariance. Metods of the complex analysis and the iteration theory are used to deal with the aforemen-tioned problems.
2016 Nov 03

# Groups and dynamics - Misha Belolipetsky

10:30am to 11:30am

## Location:

Ross 70
Arithmetic Kleinian groups generated by elements of finite order Abstract: We show that up to commensurability there are only finitely many cocompact arithmetic Kleinian groups generated by rotations. The proof is based on a generalised Gromov-Guth inequality and bounds for the hyperbolic and tube volumes of the quotient orbifolds. To estimate the hyperbolic volume we take advantage of known results towards Lehmer's problem. The tube volume estimate requires study of triangulations of lens spaces which may be of independent interest.
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 Mar 22

# Dynamics lunch seminar: Brandon Seward (HUJI): Entropy theory for non-amenable groups (part III)

12:00pm to 1:45pm

Ross 70
2015 Dec 29

# Dynamics lunch: Tom Gilat (HUJI): "Measure rigidity for `dense' multiplicative semigroups (following Einsiedler and Fish)"

12:00pm to 1:00pm

## Location:

Manchester building, Hebrew University of Jerusalem, (Coffee lounge)
2016 Jun 21

# Dynamics lunch: Genadi Levin - Monotonicity of entropy in real quadratic family'

12:00pm to 1:00pm

## Location:

Manchester building, Hebrew University of Jerusalem, (Coffee lounge)
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 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 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 08

# Dynamics lunch seminar: Brandon Seward (HUJI): Entropy theory for non-amenable groups (part I)

12:00pm to 1:45pm

## Location:

Ross 70
Entropy 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 Jun 07

# Dynamics lunch:Asaf Katz - Uniqueness of measure of maximal entropy

12:00pm to 1:00pm

## Location:

Manchester building, Hebrew University of Jerusalem, (Coffee lounge)
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.
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)