科研之友
微信
新浪微博
Facebook
分享链接
摘要
We introduce and study the notion of a directional complexity and entropy for maps of degree 1 on the circle. For piecewise affirm Markov maps we use symbolic dynamics to relate this complexity to the symbolic complexity. We apply a combinatorial machinery to obtain exact formulas for the directional entropy, to find the maximal directional entropy, and to show that it equals the topological entropy of the map.
- 出版日期2015-12
