Hostname: page-component-6898cfcb55-w5hgh Total loading time: 0 Render date: 2026-11-11T18:41:34.187Z Has data issue: false hasContentIssue false

The generalized recurrent set and strong chain recurrence

Published online by Cambridge University Press:  04 July 2016

JIM WISEMAN*
Affiliation:
Agnes Scott College, Mathematics, Decatur, Georgia 30030, USA email jwiseman@agnesscott.edu
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Fathi and Pageault have recently shown a connection between Auslander’s generalized recurrent set $\text{GR}(f)$ and Easton’s strong chain recurrent set. We study $\text{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 $\text{GR}(f^{k})=\text{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.

Information

Type
Original Article
Copyright
© Cambridge University Press, 2016