Item
AlsedÃ , LluÃs
Juher, David MaÃ±osas, Francesc 

Consider, for any n âˆˆ N, the set Pos n of all nperiodic tree patterns with positive topological entropy and the set Irr n âŠŠ Pos n of all nperiodic 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 nperiodic 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  
http://hdl.handle.net/2072/301981  
eng  
American Mathematical Society (AMS)  
Entropia topolÃ²gica
Topological entropy 

On the minimum positive entropy for cycles on trees  
info:eurepo/semantics/article  
Recercat 