For graph maps, one scrambled pair implies Li-Yorke chaos

From MaRDI portal
(Redirected from Publication:5418525)



Abstract: For a dynamical system (X,f), X being a compact metric space with metric d and f being a continuous map XoX, a set SsubseteqX is scrambled if every pair (x,y) of distinct points in S is scrambled, i.e., liminfno+inftyd(fn(x),fn(y))=0 and limsupno+inftyd(fn(x),fn(y))>0. The system (X,f) is Li-Yorke chaotic if it has an uncountable scrambled set. It is known that, for interval and circle maps, the existence of a scrambled pair implies Li-Yorke chaos, in fact the existence of a Cantor scrambled set. We prove that the same result holds for graph maps. We further show that on compact countable metric spaces one scrambled pair implies the existence of an infinite scrambled set.












This page was built for publication: For graph maps, one scrambled pair implies Li-Yorke chaos

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5418525)