Topological structure and entropy of mixing graph maps

Details Topological structure and entropy of mixing graph maps Topological structure and entropy of mixing graph maps

2011-11-02

arxiv.org/abs/1111.0566v1

Mathematics

Dynamical Systems

Scientific paper

Let $\mathcal{P}_G$ 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 $\mathcal{P}_G$ is bounded from below by $(\log 3/ \Lambda(G))$, where $\Lambda(G)$ is a constant depending on the combinatorial structure of $G$. The exact value of the infimum on $\mathcal{P}_G$ 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).

Affiliated with

Also associated with

No associations

Rating

Topological structure and entropy of mixing graph maps does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Topological structure and entropy of mixing graph maps, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Topological structure and entropy of mixing graph maps will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-329641