Currently displaying 1 – 5 of 5

Showing per page

Order by Relevance | Title | Year of publication

Non literal tranducers and some problems of normality

François Blanchard — 1993

Journal de théorie des nombres de Bordeaux

A new proof of Maxfield’s theorem is given, using automata and results from Symbolic Dynamics. These techniques permit to prove that points that are near normality to base p k (resp. p ) are also near normality to base p (resp. p k ), and to study genericity preservation for non Lebesgue measures when going from one base to the other. Finally, similar results are proved to bases the golden mean and its square.

Topological size of scrambled sets

François BlanchardWen HuangL'ubomír Snoha — 2008

Colloquium Mathematicae

A subset S of a topological dynamical system (X,f) containing at least two points is called a scrambled set if for any x,y ∈ S with x ≠ y one has l i m i n f n d ( f ( x ) , f ( y ) ) = 0 and l i m s u p n d ( f ( x ) , f ( y ) ) > 0 , d being the metric on X. The system (X,f) is called Li-Yorke chaotic if it has an uncountable scrambled set. These notions were developed in the context of interval maps, in which the existence of a two-point scrambled set implies Li-Yorke chaos and many other chaotic properties. In the present paper we address several questions about scrambled...

Page 1

Download Results (CSV)