共查询到19条相似文献，搜索用时 152 毫秒
1.
研究了文献[1]中的模映射,证明其拓扑熵为0,另外利用该映射证明了拟移位映射和移位映射拓扑共轭,从而揭示出拟移位映射是移位映射的一个重要的拓扑共轭系统. 相似文献
2.
陈尔明 《绵阳师范学院学报》2004,23(2):17-18
讨论了一类新的圆周自映射 ,证明了它是拓扑熵为零的圆周自映射。这说明了还有更多的圆周自映射 ,其拓扑熵等于零 ,从而推广了 [1][2 ]的一个结果。进而也说明了 ,圆周自映射中 ,拓扑熵为零这一条件所反映的是一种非常本质和深刻的性质。 相似文献
3.
证明了符号动力系统的拓扑熵．并将符号动力系统与概率测度空间结合起来,再结合有关定义得出了Bernoulli移位映射和Markov移位映射的熵的表达式,还得出了二周期分段函数的熵,且让普通的移位映射的熵的结果成为二周期分段函数熵的一个特殊情况． 相似文献
4.
研究了在可度量化的紧致拓扑空间X上的自映射序列{fi}在X上一致收敛于X上的自映射,的条件下fi的Bowen拓扑熵B-ent(fi)与f的Bowen拓扑熵B-ent(f)的一个关系.得到了或者存在fi,使得B-ent(f)＜B-ent(fi);或者B-ent(f)=sup1≤i＜∞ B-ent(fi). 相似文献
5.
6.
7.
邹成 《喀什师范学院学报》2009,30(6):15-17
在I=[0,1]上构造了特殊的集合和函数序列,得到一致收敛的函数序列．这时关于此函数序列的拓扑熵映射ent：C^0（I,I）→R^＋U{∞}是连续的． 相似文献
8.
徐千里 《湖南城市学院学报》1988,(6)
§5 局部拓扑度 §4讨论了n维球面S~n到自身的连续映射的拓扑度,显然研究的连续映射类是不够广泛的,而在实际上碰到的连续映射类远比这种连续映射类广泛得多。为了对一类比较广泛的连励映射类也有拓扑度的理论,所以我们在下面引进局部拓扑度的概念,这是分析学者感兴趣的。很多分析数学文献上研究的拓扑度就是这种局部拓扑度。为了保持前后一致,我们仍用代数拓扑的方法来研究。基本思路是用球面到自身的连续映射的拓扑 相似文献
9.
本文研究了两种计算二维映象拓扑熵的方法。一种是用从哈密顿量得到耗散映象轨道的方法,根据拓扑熵的定义,通过计算二维映象的不稳定周期轨道数,以Hnon映象为例,研究了拓扑熵随不可积参数变化的规律。另一种是从拓扑熵、测度熵和Lyapunov指数的定义出发,研究三者之间的一般关系,通过计算映象运动轨道的Lyapunov指数,以二维“标准映象”为例,研究了拓扑熵与参数之间的关系。 相似文献
10.
研究一般拓扑动力系统的复杂性是很困难的。拓扑共轭、拓扑半共轭、嵌入映射和转移不变集都可以不同程度保持动力系统的复杂性。本文通过研究拓扑动力系统与符号动力系统拓扑共轭,找到了拓扑动力(子)系统存在转移不变集的条件,这样就可以通过研究相对简单和形象的符号动力系统,间接的反应一般拓扑动力(子)系统的动力性状。 相似文献
11.
Graph complexity as measured by topological entropy has been previously shown to affect performance on artificial grammar learning tasks among typically developing children. The aim of this study was to examine the effect of graph complexity on implicit sequential learning among children with developmental dyslexia. Our goal was to determine whether children’s performance depends on the complexity level of the grammar system learned. We conducted two artificial grammar learning experiments that compared performance of children with developmental dyslexia with that of age- and reading level-matched controls. Experiment 1 was a high topological entropy artificial grammar learning task that aimed to establish implicit learning phenomena in children with developmental dyslexia using previously published experimental conditions. Experiment 2 is a lower topological entropy variant of that task. Results indicated that given a high topological entropy grammar system, children with developmental dyslexia who were similar to the reading age-matched control group had substantial difficulty in performing the task as compared to typically developing children, who exhibited intact implicit learning of the grammar. On the other hand, when tested on a lower topological entropy grammar system, all groups performed above chance level, indicating that children with developmental dyslexia were able to identify rules from a given grammar system. The results reinforced the significance of graph complexity when experimenting with artificial grammar learning tasks, particularly with dyslexic participants. 相似文献
12.
There’s a long held view that chunks play a crucial role in artificial grammar learning performance. We compared chunk strength influences on performance, in high and low topological entropy (a measure of complexity) grammar systems, with dyslexic children, age-matched and reading-level-matched control participants. Findings show that age-matched control participants’ performance reflected equivalent influence of chunk strength in the two topological entropy conditions, as typically found in artificial grammar learning experiments. By contrast, dyslexic children and reading-level-matched controls’ performance reflected knowledge of chunk strength only under the low topological entropy condition. In the low topological entropy grammar system, they appeared completely unable to utilize chunk strength to make appropriate test item selections. In line with previous research, this study suggests that for typically developing children, it is the chunks that are attended during artificial grammar learning and create a foundation on which implicit associative learning mechanisms operate, and these chunks are unitized to different strengths. However, for children with dyslexia, it is complexity that may influence the subsequent memorability of chunks, independently of their strength. 相似文献
13.
In the light of Ф-mapping method and the relationship between entropy and the Euler characteristic, the intrinsic topological structure of entropy of Kerr black holes is studied. From the Ganss-Bonnet-Chem theorem, it is shown that the entropy of Kerr black hole is determined by singularities of the Killing vector field of spacetime. These singularities naturally carry topological numbers, Hopf indices and Brouwer degrees, which can also be viewed as topological quantization of entropy of Kerr black holes. Specific results S = A/4 for non-extreme Kerr black holes and S = 0 for extreme ones are calculated independently by using the above-mentioned methods. 相似文献
14.
15.
本文从通常所说的球面与扩充平面(平面上添加一个新元素)间的对应关系入手,得到n维球面与n维扩充空间(n维欧氏空间Rn添加一个新元素)间的同胚关系,并用拓扑学知识阐明n维球面与n维欧氏空间Rn是不可能同胚的. 相似文献
16.
章的目的是要把各类下半连续型集值映射的定义推广到不带有任何度量的拓扑空间中并且作仔细的比较．同时，一些例子被研究．特别地，中证明了：一个几乎下半连续映射F不必是次下半连续的，但是，次下半连续映射必定是几乎下半连续的． 相似文献
17.
陈杰东 《内江师范学院学报》2005,20(6):88-90
由于几何拓扑网络设计中许多问题都可以归结为极小极大问题，而熵函数法正是求解极小极大问题的一个强有力的数学工具，所以本文试图运用熵函数法求解一些几何拓扑网络设计问题．理论分析和试验结果均表明了熵函数法求解这些问题的有效性． 相似文献
18.
唐永才 《荆门职业技术学院学报》2004,19(3):42-43,47
引进拓扑空间X的可序列收敛性质，证明了这一性质是可商的性质．在此基础上，给出在一般拓扑空间上，连续映射可用序列收敛性质刻划的条件是充分的而非必要条件．顺便指出文[1]中一说法的不妥与疏忽． 相似文献
19.