Topological structure and entropy of mixing graph maps
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2011
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866913117322084352 |
|---|---|
| author | Harańczyk, Grzegorz Kwietniak, Dominik Oprocha, Piotr |
| author_facet | Harańczyk, Grzegorz Kwietniak, Dominik Oprocha, Piotr |
| contents | 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/ Λ(G))$, where $Λ(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). |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1111_0566 |
| institution | arXiv |
| publishDate | 2011 |
| record_format | arxiv |
| spellingShingle | Topological structure and entropy of mixing graph maps Harańczyk, Grzegorz Kwietniak, Dominik Oprocha, Piotr Dynamical Systems 37B40, 37B20 (Primary) 37E05, 37E10 (Secondary) 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/ Λ(G))$, where $Λ(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). |
| title | Topological structure and entropy of mixing graph maps |
| topic | Dynamical Systems 37B40, 37B20 (Primary) 37E05, 37E10 (Secondary) |
| url | https://arxiv.org/abs/1111.0566 |