Author:
Foryś-Krawiec Magdalena,Hantáková Jana,Oprocha Piotr
Abstract
<p style='text-indent:20px;'>In the paper we study what sets can be obtained as <inline-formula><tex-math id="M2">\begin{document}$ \alpha $\end{document}</tex-math></inline-formula>-limit sets of backward trajectories in graph maps. We show that in the case of mixing maps, all those <inline-formula><tex-math id="M3">\begin{document}$ \alpha $\end{document}</tex-math></inline-formula>-limit sets are <inline-formula><tex-math id="M4">\begin{document}$ \omega $\end{document}</tex-math></inline-formula>-limit sets and for all but finitely many points <inline-formula><tex-math id="M5">\begin{document}$ x $\end{document}</tex-math></inline-formula>, we can obtain every <inline-formula><tex-math id="M6">\begin{document}$ \omega $\end{document}</tex-math></inline-formula>-limits set as the <inline-formula><tex-math id="M7">\begin{document}$ \alpha $\end{document}</tex-math></inline-formula>-limit set of a backward trajectory starting in <inline-formula><tex-math id="M8">\begin{document}$ x $\end{document}</tex-math></inline-formula>. For zero entropy maps, every <inline-formula><tex-math id="M9">\begin{document}$ \alpha $\end{document}</tex-math></inline-formula>-limit set of a backward trajectory is a minimal set. In the case of maps with positive entropy, we obtain a partial characterization which is very close to complete picture of the possible situations.</p>
Publisher
American Institute of Mathematical Sciences (AIMS)
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics,Analysis
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献