期刊名称：International Journal of Mathematics and Mathematical Sciences
印刷版ISSN：0161-1712
电子版ISSN：1687-0425
出版年度：2005
卷号：2005
DOI：10.1155/IJMMS.2005.3025
出版社：Hindawi Publishing Corporation
摘要：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
