### Abstract

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.

Original language | English |
---|---|

Pages (from-to) | 1373-1400 |

Journal | Ergodic Theory and Dynamical Systems |

Volume | 25 |

DOIs | |

Publication status | Published - 1 Oct 2005 |

## Fingerprint Dive into the research topics of 'Periodic behavior on trees'. Together they form a unique fingerprint.

## Cite this

Alsedà, L., Juher, D., & Mumbrú, P. (2005). Periodic behavior on trees.

*Ergodic Theory and Dynamical Systems*,*25*, 1373-1400. https://doi.org/10.1017/S0143385704000896