BGU Probability and Ergodic Theory (PET) seminar Ical Atom

We generalize the combinatorial approaches of Rapaport and Higgins–Lyndon to the Whitehead algorithm. We show that for every automorphism φ of a free group F and every word u∈F there exists a finite multiset of words Su,φ satisfying the following property: For every cyclic word w, the number of times u appears as a subword of φ(w) depends only on the appearances of words in Su,φ as subwords of w. We use this fact to construct a faithful representation of Out(Fn) on an inverse limit of Z-modules, so that each automorphism is represented by sequence of finite rectangular matrices, which can be seen as successively better approximations of the automorphism.

Classical Szpilrajn theorem states that any partial order could be extended to a linear order. An invariant random order (IRO) on a countable group is an invariant under the shift-action probability measure on the space of all partial orders on the group. It is natural to ask whether the invariant analog of Szpilrajn theorem, the invariant random order extension property, holds for IRO’s. This property is easy to demonstrate for amenable groups. Recently, Glasner, Lin a Meyerovitch gave a first example where this property fails. Based on their construction, I will show that the IRO extension property fails for all non-amenable groups.

We consider the family of periodic measures for the full diagonal action on the space of unimodular lattices. This family is important and natural due to its tight relation to class groups in number fields. We show that many natural families of measures on the space of lattices can be approximated using this family (in the weak sense). E.g., we show that for any 0<c\leq 1, the measure cm_{X_n} can be approximated this way, where m_{X_n} denotes the Haar probability measure on X_n. Moreover, we show that non ergodic measures can be approximated. Our proof is based on the equidistribution of Hecke neighbors and on constructions of special number fields. We will discuss the results, alternative ways to attack the problem, and our method of proof. This talk is based on a joint work with Omri Solan.

Combinatorial nonpositive curvature of CAT(0) cube complexes plays a surprising role both in topological characterization of hyperbolic 3-manifolds and also in studying algebraic properties of random groups.
With Einstein, Krishna MS, Montee, and Steenbock, we introduce a new model for random quotients of free products that generalizes Gromov’s destiny model. I will discuss challenges that arise in this new setting, connections to work of Futer-Wise and Martin-Steenbock on cubulating quotients, as well as applications to residual finiteness using recent work of Einstein and Groves on relative cubulation.

We show that isomorphic finite index subgroups of non-elementary hyperbolic groups must have the same index. In this talk I will present the tools and ideas of the proof.

Mixing is an important spectral property of dynamical systems and it can be described concretely. But, “In general a measure preserving transformation is” only “mixing” along a sequence of density one, by the Rhoklin-Halmos theorem. On the other hand, mixing on some sequences implies mixing. Formally, the mixing can be defined by demanding that the ergodic averages along any increasing sequence converge in mean, thanks to the Blum-Hanson theorem. In my talk, I will present my recent joint contribution with Terry Adams to Bergelson’s question asked online during the Lille conference 2021: Does mixing on the squares imply mixing? We first obtain a characterization of a sequence for which mixing on it implies mixing. We further establish that there are non-mixing maps that are mixing on appropriate sequences. We extend also our results to the group action with the help of the Host-Parreau characterization of the set of continuity from Harmonic Analysis. We further extended our result to the Real line action. As a open question, we ask pour extension our our result to the case of non-commutative case and specially Heisenberg group action.

We will discuss a joint work with Dalibor Volny where we show that for every ergodic and aperiodic probability preserving transformation and α∈(0,2) there exists a function whose associated time series is in the standard domain of attraction of a non-degenerate symmetric α-stable distribution.

Two flows are said to be Kakutani equivalent if one is isomorphic to the other after time change, or equivalently if there are Poincare sections for the flows so that the respective induced maps are isomorphic to each other. Ratner showed that if $G=\operatorname{SL}(2,\mathbb{R})$ and $\Gamma$ is a lattice in $G$, and if $u_t$ is a one parameter unipotent subgroup in $G$ then the $u_t$ action on $G/\Gamma$ equipped with Haar measure is loosely Bernoulli, i.e.\ Kakutani equivalent to a circle rotation. Thus any two such systems $(\operatorname{SL}(2,\mathbb{R})/\Gamma_i, u_t, m_i)$ are Kakutani equivalent to each other. On the other hand, Ratner showed that if $G=\operatorname{SL}(2,\mathbb{R})\times \operatorname{SL}(2,\mathbb{R})$ and $\Gamma$ is a reducible lattice, and $u_t$ is the diagonally embedded one parameter unipotent subgroup in $G$, then $(G/\Gamma, u_t, m)$ is not loosely Bernoulli.

We show that in fact in this case and many other situations one cannot have Kakutani equivalence between such systems unless they are actually isomorphic.

This is a joint work with Elon Lindenstrauss.

I will discuss a random walk on a metric graph, that is, on a one-dimensional cell complex. The main difference from the often considered case is that the endpoint of a walk can be any point on an edge of a metric graph and not just one of the vertices. Let a point start its motion along the path graph from a hanging vertex at the initial moment of time. The passage time for each individual edge is fixed. At each vertex, the point selects one of the edges for further movement with some nonzero probability. Backward turns on the edges are prohibited in this model. One could find asymptotics for the number N(T) of possible endpoints of such a random walk as the time T increases, i.e. number of all possible lengths of paths on metric graph that not exceed T. Solutions to this problem, depending on the type of graph, are associated with different problems of number theory. An overview of the results, which depend on the arithmetic properties of lengths, will be given as well as review of open problems.

We show that the orbit equivalence relation of an action of a hyperbolic group on its Gromov boundary has finite Borel asymptotic dimension. As a corollary, that recovers the theorem of Marquis and Sabok which states that this orbit equivalence relation is hyperfinite.

A connection between the deformation rate of a small set boundary in the phase space of a dynamical system and the metric entropy of the system was claimed (not too rigorously) in physics literature.

Rigorous results were obtained by B. Gurevich for discrete time Markov shifts and later generalized for synchronized systems by me. Further, such a connection was established in joint work by B. Gurevich and S. Komech for Anosov diffeomorphisms, and for suspension flows in joint work by B. Gurevich, S. Komech and A. Tempelman. For symbolic dynamical systems, we estimate deformation rate in terms of an ergodic invariant measure, while for Anosov systems we use the volume. We will present specific details of our approach.

An analytic endomorphism of the unit disk is called an inner function if it’s boundary limit defines a transformation of the circle - which is necessarily Lebesgue nonsingular. I’ll review the ergodic theory of inner functions & then present results on:

– their structure;

– spectral gaps for their transfer operators; and

– a conditional central limit theorem;

all recently obtained with Mahendra Nadkarni.