Topological and algebraic reducibility for patterns on trees

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 h...

ver descrição completa

Detalhes bibliográficos
Autores: Alsedà, Lluís|||0000-0001-9908-1063, Juher, David|||0000-0001-5440-1705, Mañosas, Francesc|||0000-0003-2535-0501
Tipo de documento: artigo
Data de publicação:2015
País:España
Recursos:Universitat Autònoma de Barcelona
Repositório:Dipòsit Digital de Documents de la UAB
Idioma:inglês
OAI Identifier:oai:ddd.uab.cat:145364
Acesso em linha:https://ddd.uab.cat/record/145364
https://dx.doi.org/urn:doi:10.1017/etds.2013.52
Access Level:Acceso aberto
Palavra-chave:Tree maps
Patterns
Topological entropy
Block structure
Descrição
Resumo: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-th iterate of the map on the invariant set have zero (respectively, positive) entropy, for each k relatively prime to n.