Item


The minimum tree for a given zero-entropy period

We answer the following question: given any n∈ℕ, which is the minimum number of endpoints en of a tree admitting a zero-entropy map f with a periodic orbit of period n? We prove that en=s1s2…sk−∑i=2ksisi+1…sk, where n=s1s2…sk is the decomposition of n into a product of primes such that si≤si+1 for 1≤ie, then the topological entropy of f is positive

International Journal of Mathematics and Mathematical Sciences, 2005, núm. 19, p. 3025-3033

Hindawi Publishing Corporation

Author: Barrabés Vera, Esther
Juher, David
Date: 2005
Abstract: We answer the following question: given any n∈ℕ, which is the minimum number of endpoints en of a tree admitting a zero-entropy map f with a periodic orbit of period n? We prove that en=s1s2…sk−∑i=2ksisi+1…sk, where n=s1s2…sk is the decomposition of n into a product of primes such that si≤si+1 for 1≤ie, then the topological entropy of f is positive
Format: application/pdf
ISSN: 0161-1712 (versió paper)
1687-0425 (versió electrònica)
Document access: http://hdl.handle.net/10256/8985
Language: eng
Publisher: Hindawi Publishing Corporation
Collection: Reproducció digital del document publicat a: http://dx.doi.org/10.1155/IJMMS.2005.3025
Articles publicats (D-IMA)
Is part of: International Journal of Mathematics and Mathematical Sciences, 2005, núm. 19, p. 3025-3033
Rights: Attribution 3.0 Spain
Rights URI: http://creativecommons.org/licenses/by/3.0/es/
Subject: Òrbites
Orbits
Entropia topològica
Topological entropy
Title: The minimum tree for a given zero-entropy period
Type: info:eu-repo/semantics/article
Repository: DUGiDocs

Subjects

Authors