On Graph-realizable Sets of Periods (Q4408580)

A compact one-dimensional branched manifold is called a graph and a subset \(A\subset\mathbb{N}\) is called a graph-realizable set of periods if there is a graph \(X\) and a continuous map \(f: X\to X\) such that the set of periodic points of \(f\) is exactly \(A\). It is proved that a set \(A\subset\mathbb{N}\) is graph realizable if and only if there is a finite union \(B\) of sets of the form \(l\mathbb{N}\) such that \(A\Delta B\) is finite. Similarly, a subset \(A\subset\mathbb{N}\) is called zero graph realizable, if in addition \(f\) has zero entropy. In this case, the necessary and sufficient condition reduces to \(B\) being a finite union of sets of the form \(\{2^i n: i\geq 0\}\). This characterizes the structure of periodic points as in \textit{A. N. Sharkovskij's} theorem [Ukr. Math. Zh. 13, 86--94 (1961; Zbl 0106.09802)].