I will discuss, for differentiable dynamical systems, three ways to capture dynamical complexity:
hyperbolicity, which measures the sensitivity of dependence on initial conditions.
entropy, which measures the predictability of future dynamical events in the sense of information theory.
the speed of correlation decay or equivalently the rate at which memory is lost.

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.

Abstract:
We will present an elementary problem and a conjecture regarding percolation on planar graphs suggested by assuming quasi invariance of percolation crossing probabilities under coarse conformal uniformization.

Let S be a finite set (the sample space), and 
f_i: S -> R functions, for 1 ≤ i ≤ k. Given a k-tuple (v_1,...,v_k) in R^k
it is natural to ask: 
What is the distribution P on S that maximizes the entropy
      -Σ P(x) log(P(x))
subject to the constraint that the expectation of f_i be v_i?
In this talk I'll discuss a closed formula for the solution P
in terms of a sum over cumulant trees. This is based on a general calculus
for solving perturbative optimization problems due to Feynman, which may be
of interest in its own right. 

Abstract: This talk will introduce the notion of Gaussian and almost Gaussian log-correlated fields. These are a class of random (or almost random) functions many of whose statistics are predicted to coincide in a large system-size limit. Examples of these objects include:
(1) the logarithm of the Riemann zeta function on the critical line (conjecturally)
(2) the log-characteristic polynomial of Haar distributed unitary random matrices (and others),
(3) the deviations of Birkhoff sums of substitution dynamical systems (conjecturally)

In the paper "Mean dimension, small entropy factors and an
embedding theorem, Inst. Hautes Études Sci. Publ. Math 89 (1999)
227-262", Lindenstrauss showed that minimal systems of mean dimension
less than $cN$ for $c=1/36$ embed equivariantly into the Hilbert cubical
shift $([0,1]^N)^{\mathbb{Z}}$, and asked what is the optimal value
for $c$. We solve this problem by proving that $c=1/2$. The method of
proof is surprising and uses signal analysis sampling theory. Joint
work with Masaki Tsukamoto.

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.

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.

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.