Abstract
This paper deals with the topological entropy for hom Markov shifts T M on d -tree. If M is a reducible adjacency matrix with q irreducible components M 1 , ⋯ , M q , we show that h ( T M ) = max 1 ≤ i ≤ q h ( T M i ) fails generally, and present a case study with full characterization in terms of the equality. Though that it is likely the sets { h ( T M ) : M is binary and irreducible } and { h ( T X ) : X is a one-sided shift } are not coincident, we show the two sets share the common closure. Despite the fact that such closure is proved to contain the interval [ d log 2 , ∞ ) , numerical experiments suggest its complement contain open intervals.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
