TY - JOUR

T1 - Periodic behavior on trees

AU - Alsedà, Ll

AU - Juher, D.

AU - Mumbrú, P.

PY - 2005/10/1

Y1 - 2005/10/1

N2 - We characterize the set of periods for tree maps. More precisely, we prove that the set of periods of any tree map f : T → T is the union of finitely many initial segments of Baldwin's orderings p≥ and a finite set F. The possible values of p and explicit upper bounds for the size of F are given in terms of the combinatorial properties of the tree T. Conversely, given any set A which is a union of finitely many initial segments of Baldwin's orderings p≥ with p of the above type and a finite set, we prove that there exists a tree map whose set of periods is A. © 2005 Cambridge University Press.

AB - We characterize the set of periods for tree maps. More precisely, we prove that the set of periods of any tree map f : T → T is the union of finitely many initial segments of Baldwin's orderings p≥ and a finite set F. The possible values of p and explicit upper bounds for the size of F are given in terms of the combinatorial properties of the tree T. Conversely, given any set A which is a union of finitely many initial segments of Baldwin's orderings p≥ with p of the above type and a finite set, we prove that there exists a tree map whose set of periods is A. © 2005 Cambridge University Press.

U2 - https://doi.org/10.1017/S0143385704000896

DO - https://doi.org/10.1017/S0143385704000896

M3 - Article

VL - 25

SP - 1373

EP - 1400

JO - Ergodic Theory and Dynamical Systems

JF - Ergodic Theory and Dynamical Systems

SN - 0143-3857

ER -