visitant ::
identificació
|
|||||||||||||||
Cerca | Lliura | Ajuda | Servei de Biblioteques | Sobre el DDD | Català English Español |
Pàgina inicial > Articles > Articles publicats > On the minimum positive entropy for cycles on trees |
Data: | 2017 |
Resum: | Consider, for any n ∈ N, the set Posn of all n-periodic tree patterns with positive topological entropy and the set Irrn ( Posn of all n-periodic irreducible tree patterns. The aim of this paper is to determine the elements of minimum entropy in the families Posn and Irrn. Let λn be the unique real root of the polynomial xn − 2x − 1 in (1, +∞). We explicitly construct an irreducible n-periodic tree pattern Qn whose entropy is log(λn). For n = mk, where m is a prime, we prove that this entropy is minimum in the set Posn. Since the pattern Qn is irreducible, Qn also minimizes the entropy in the family Irrn. |
Ajuts: | Ministerio de Economía y Competitividad MTM2008-01486 Ministerio de Economía y Competitividad MTM2011-26995-C02-01 |
Drets: | Tots els drets reservats. |
Llengua: | Anglès |
Document: | Article ; recerca ; Versió acceptada per publicar |
Matèria: | Tree maps ; Periodic patterns ; Topological entropy |
Publicat a: | Transactions of the American Mathematical Society, Vol. 369 Núm. 1 (2017) , p. 187-221, ISSN 1088-6850 |
Postprint 31 p, 570.9 KB |