树映射的拓扑可迁性  

Some remarks on topologically transitive tree maps

作　　者：汪火云[1] 吴红英[1] 刘兴臻[1] 

机构地区：[1]广州大学数学与信息科学学院,广东广州510006

出　　处：《广州大学学报（自然科学版）》2008年第4期12-14,共3页Journal of Guangzhou University:Natural Science Edition

基　　金：国家自然科学基金资助项目(10771079;10471049)

摘　　要：拓扑可迁属性是刻划系统复杂性的重要概念.对树上连续自映射拓扑可迁性进行了探讨.将区间映射一些拓扑可迁属性推广到树映射上.指出:对树上连续自映射而言,拓扑混合等价于完全拓扑可迁,拓扑遍历等价于拓扑可迁,拓扑混合等价于拓扑弱混合.This paper deals with topologically transitive tree maps. In terms of continuous maps of tree, topologically mixing and toally topologically transitive are identical, and topologically ergodic and topologically transitive are identical. Furthermore, so are topologically mixing and topologically weakly mixing.

关 键 词：拓扑可迁 拓扑遍历 拓扑混合 

分 类 号：O189.11[理学—数学]