Abstract
Let be a compact tree, be a continuous map from to itself, be the number of endpoints and be the number of edges of . We show that if has no prime divisors less than and has a cycle of period , then has cycles of all periods greater than and topological entropy ; so if is the least prime number greater than and has cycles of all periods from 1 to , then has cycles of all periods (this verifies a conjecture of Misiurewicz for tree maps). Together with the spectral decomposition theorem for graph maps it implies that iff there exists such that has a cycle of period for any . We also define {\it snowflakes} for tree maps and show that iff every cycle of is a snowflake or iff the period of every cycle of is of form where is an odd integer with prime divisors less than .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.