Ítem
Alsedà i Soler, Lluís
Juher, David Mañosas, Francesc |
|
1 gener 2017 | |
Consider, for any n ∈ N, the set Pos n of all n-periodic tree patterns with positive topological entropy and the set Irr n ⊊ Pos n of all n-periodic irreducible tree patterns. The aim of this paper is to determine the elements of minimum entropy in the families Pos n and Irr n . Let λ n be the unique real root of the polynomial x n − 2x − 1 in (1, + ∞). We explicitly construct an irreducible n-periodic tree pattern Q n whose entropy is log(λ n ). For n = m k , where m is a prime, we prove that this entropy is minimum in the set Pos n . Since the pattern Q n is irreducible, Q n also minimizes the entropy in the family Irr n | |
application/pdf | |
http://hdl.handle.net/10256/14607 | |
eng | |
American Mathematical Society (AMS) | |
info:eu-repo/semantics/altIdentifier/doi/10.1090/tran6677 info:eu-repo/semantics/altIdentifier/issn/0002-9947 info:eu-repo/semantics/altIdentifier/eissn/1088-6850 |
|
Tots els drets reservats | |
Entropia topològica
Topological entropy |
|
On the minimum positive entropy for cycles on trees | |
info:eu-repo/semantics/article | |
DUGiDocs |