2026-04-17T21:30:15Zhttps://recercat.cat/oai/request

oai:recercat.cat:10256/151382024-06-18T12:17:20Zcom_2072_452955com_2072_2054col_2072_453069

00925njm 22002777a 4500 dc Alsedà i Soler, Lluís author Juher, David author Mañosas, Francesc author 2015-02 We extend the classical notion of block structure for periodic orbits of interval maps to the setting of tree maps and study the algebraic properties of the Markov matrix of a periodic tree pattern having a block structure. We also prove a formula which relates the topological entropy of a pattern having a block structure with that of the underlying periodic pattern obtained by collapsing each block to a point, and characterize the structure of the zero entropy patterns in terms of block structures. Finally, we prove that an n-periodic pattern has zero (positive) entropy if and only if all n-periodic patterns obtained by considering the k\mathrm{th} iterate of the map on the invariant set have zero (respectively, positive) entropy, for each k relatively prime to n The authors have been partially supported by MEC grant numbers MTM2008-01486 and MTM2011-26995-C02-01 http://hdl.handle.net/10256/15138 Arbres (Teoria de grafs) Trees (Graph theory) Topologia algebraica Algebraic topology Topological and algebraic reducibility for patterns on trees