arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1111.0566math.DS
收藏

拓扑结构与混合图映射的熵

Topological structure and entropy of mixing graph maps

Institute of Mathematics, Jagiellonian University(雅盖隆大学数学研究所);Faculty of Applied Mathematics, AGH University of Science and Technology(AGH科技大学应用数学学院);Institute of Mathematics, Polish Academy of Sciences(波兰科学院数学研究所)

Grzegorz Harańczyk, Dominik Kwietniak, Piotr Oprocha

AI总结:

研究了图拓扑混合映射的熵下界,证明了其最小值不小于(log 3)/Λ(G),并针对某些图族计算了精确值,利用改进的混合图映射结构定理。

摘要:

设$\mathcal{P}_G$为所有拓扑混合但不精确的图$G$的自映射族。证明了$\mathcal{P}_G$中映射的拓扑熵下确界不小于$(\log 3/ Λ(G))$,其中$Λ(G)$依赖于图$G$的组合结构。对某些图族计算了$\mathcal{P}_G$上的精确下确界。主要工具是混合图映射结构定理的改进版本。该方法还为已知结果提供了新证明,包括Blokh定理(拓扑混合映射在图上具有指定性质)。

英文摘要:

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).

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑