English

Structures of $R(f)-\overline{P(f)}$ for graph maps $f$

Dynamical Systems 2023-10-31 v1

Abstract

Let GG be a graph and f:GGf: G\rightarrow G be a continuous map. We establish a structure theorem which describes the structures of the set R(f)P(f)R(f)-\overline{P(f)}, where R(f)R(f) and P(f)P(f) are the recurrent point set and the periodic point set of ff respectively. Roughly speaking, the set R(f)P(f)R(f)-\overline{P(f)} is covered by finitely many pairwise disjoint ff-invariant open sets U1,,UnU_{1\,},\,\cdots,\,U_{n\,}; each UiU_i contains a unique minimal set WiW_i which absorbs each point of UiU_i; each WiW_i 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 UiU_i and permutated cyclically by ff. As applications of the structure theorem, several known results are improved or reproved.

Keywords

Cite

@article{arxiv.2310.18971,
  title  = {Structures of $R(f)-\overline{P(f)}$ for graph maps $f$},
  author = {Jiehua Mai and Enhui Shi and Kesong Yan and Fanping Zeng},
  journal= {arXiv preprint arXiv:2310.18971},
  year   = {2023}
}