The generalized recurrent set and strong chain recurrence

From MaRDI portal
Publication:4643264




Abstract: Fathi and Pageault have recently shown a connection between Auslander's generalized recurrent set GR(f) and Easton's strong chain recurrent set. We study GR(f) by examining that connection in more detail, as well as connections with other notions of recurrence. We give equivalent definitions that do not refer to a metric. In particular, we show that GR(fk)=GR(f) for any k>0, and give a characterization of maps for which the generalized recurrent set is different from the ordinary chain recurrent set.



Cites work









This page was built for publication: The generalized recurrent set and strong chain recurrence

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