Strong stochastic stability and rate of mixing for unimodal maps
We study the relation between transitivity and strong transitivity, introduced by W. Parry, for graph self-maps. We establish that if a graph self-map f is transitive and the set of fixed points of is finite for each k ≥ 1, then f is strongly transitive. As a corollary, if a piecewise monotone graph self-map is transitive, then it is strongly transitive.
We call a sequence of measure preserving transformations strongly mixing if tends to for arbitrary measurable , . We investigate whether one can pass to a suitable subsequence such that almost surely for all (or “many”) integrable .
Un feuilletage de codimension un sur une variété orientable est de Rolle s’il vérifie la propriété suivante : une courbe transverse à coupe au plus une fois chaque feuille. Soit une fonction tapissante sur , i.e. propre et possédant un nombre fini de valeurs critiques. Nous montrons que si l’ensemble des singularités de la restriction de aux feuilles de vérifie certaines propriétés de finitude, alors la restriction de au complémentaire d’un nombre fini de feuilles possède une structure...
Using methods of symbolic dynamics, we analyze the structure of composants of the inverse limit spaces of tent maps with finite critical orbit. We define certain symmetric arcs called bridges. They are building blocks of composants. Then we show that the folding patterns of bridges are characterized by bridge types and prove that there are finitely many bridge types.
We study topology of leaves of -dimensional singular holomorphic foliations of Stein manifolds. We prove that for a generic foliation all leaves, except for at most countably many, are contractible, the rest are topological cylinders. We show that a generic foliation is complex Kupka-Smale.
We show that, for the family of functions where n ≥ 3 and λ ∈ ℂ, there is a unique McMullen domain in parameter space. A McMullen domain is a region where the Julia set of is homeomorphic to a Cantor set of circles. We also prove that this McMullen domain is a simply connected region in the plane that is bounded by a simple closed curve.
In this paper we describe a -dimensional generalization of the Euclidean algorithm which stems from the dynamics of -interval exchange transformations. We investigate various diophantine properties of the algorithm including the quality of simultaneous approximations. We show it verifies the following Lagrange type theorem: the algorithm is eventually periodic if and only if the parameters lie in the same quadratic extension of