Topological structure and entropy of mixing graph maps

From MaRDI portal
Publication:2928252

DOI10.1017/ETDS.2013.6zbMATH Open1351.37174arXiv1111.0566OpenAlexW2964121303MaRDI QIDQ2928252FDOQ2928252


Authors: Grzegorz Harańczyk, Dominik Kwietniak, Piotr Oprocha Edit this on Wikidata


Publication date: 7 November 2014

Published in: Ergodic Theory and Dynamical Systems (Search for Journal in Brave)

Abstract: Let mathcalPG be the family of all topologically mixing, but not exact self-maps of a topological graph G. It is proved that the infimum of topological entropies of maps from mathcalPG is bounded from below by (log3/Lambda(G)), where Lambda(G) is a constant depending on the combinatorial structure of G. The exact value of the infimum on mathcalPG is calculated for some families of graphs. The main tool is a refined version of the structure theorem for mixing graph maps. It also yields new proofs of some known results, including Blokh's theorem (topological mixing implies specification property for maps on graphs).


Full work available at URL: https://arxiv.org/abs/1111.0566




Recommendations




Cites Work


Cited In (10)





This page was built for publication: Topological structure and entropy of mixing graph maps

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2928252)