Structures of R(f)-P(f) for graph maps f
Abstract
Let G be a graph and f: G→ G be a continuous map. We establish a structure theorem which describes the structures of the set R(f)-P(f), where R(f) and P(f) are the recurrent point set and the periodic point set of f respectively. Roughly speaking, the set R(f)-P(f) is covered by finitely many pairwise disjoint f-invariant open sets U1\,,\,·s,\,Un\,; each Ui contains a unique minimal set Wi which absorbs each point of Ui; each Wi lies in finitely many pairwise disjoint circles each of which is contained in a connected closed set; all of these connected closed sets are contained in Ui and permutated cyclically by f. As applications of the structure theorem, several known results are improved or reproved.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.