Abstract In this paper we give a fully combinatorial description of the zero entropy periodic patterns on trees. Unlike previously known characterizations of such patterns, our criterion is independent of any particular topological realization of the pattern and provides, thus, a practical and fast algorithm to test zero entropy. As an application, consider a {k} k -star {T} T (a tree with {k} k edges attached at a unique branching point of valence {k} k) and the set F₍, ₊ F n, k of all continuous maps f: T T f: T ⟶ T having a periodic orbit of period n properly contained in {T} T (each edge of {T} T contains at least one point of the orbit). We find all pairs { (n, k) } (n, k) such that F₍, ₊ F n, k contains maps of entropy zero, and we describe the patterns of such zero-entropy orbits.
Juher et al. (Fri,) studied this question.