关于代换系统拓扑序列熵的注记

Goodman证明了对两符号等长代换系统, 如果代换规则中0和1对应的词只有一个位置不同,那么对应的代换系统为null的, 即此系统沿着任意正整数序列的序列熵均为0. 在本文中, 我们针对系统的结构特征, 通过考察因子系统, 给出了此经典结果的另外一种证明. 同时, 对此类代换系统沿着给定序列的复杂性, 我们得到了比Goodman更为精确的估计.     

本原代换的非周期不动点的Hausdorff维数函数

设 Ａ＝｛０, １,…, Ｎ－１｝,ξ是 Ａ上的一个本原代换, ｕ是ξ的非周期不动点．记 Ｘ（ξ）＝Ｏｒｂ（ｕ） 本文证明了：Ｘ（ξ）的Ｈａｕｓｄｏｒｆｆ维数函数是ｈ（ｘ）＝－ｌｏｇＮ／ｌｏｇｘ     

通过由代换序列生成的一维链的绝缘性

本文建立了平面波ｅ＾－ｉｋｘ通过势ｕＮ（ｘ）＝ＮΣｎ＝１ｖｎδ（ｘ－ｘｎ），Ｎ→＋∞时系统的透射振幅和反射振幅的递推公式；给出系统为绝缘体的充要条件；最后，找出了判断由代换序列生成的一类一维链系统为绝缘体的方法。     

双符号等长代换系统的序列熵

系统称为null的,如果对任意序列,它的序列熵为零.双符号等长代换及其对应的代换极小系统可分成三类:有限的、离散的和连续的.容易看出离散的代换极小系统是null的,Goodman证明了连续的代换极小系统不是null的.本文将完全刻画所有的双符号等长代换极小系统的序列墒.     

例谈三角代换在竞赛中的应用

三角函数蕴含着丰富的公式与性质,巧妙地运用这些公式与性质进行变量代换可以顺利地解决许多综合问题．笔者在辅导竞赛中发现,三角代换在很多问题中能够简化题设信息,使隐性条件显性化,从而沟通量与量之间的关系,对发现解题的思路、优化解题的过程起到了积极的推进作用．本文结合实例说明三角代换在求最值、证明不等式、解决数列问题和解方程（组）中的广泛应用,供参考．     

混沌与拓扑强混合

讨论了拓扑强混合、Li—Yorke混沌和修改的Devaney混沌三者之间的关系,我们得到:Li—Yorke混沌与修改的Devaney混沌无蕴涵关系;Li—Yorke混沌和修改的Devaney混沌均不能蕴涵着拓扑强混合,这解决了文献[1]中提出的两个问题.     

代换策略在分式问题中的应用探究

在解数学问题的过程中,把其中某个代数式（或超越式,或函数式）看成一个整体,用一个新变量作代换,从而使问题的解答便于进行,这种方法叫做代换法．代换法既是一种重要的解题方法,也蕴含有丰富的解题技巧,其应用目的是把复杂的结构形式转化为简单的结构形式,把隐含的条件显露出来,把分散的条件联系起来,使问题化难为易,化繁为简,化陌生为熟悉．实际应用时应根据所给问题的特点,灵活选取适当的代换方法,既有利于提高解题能力,也有利于扎实数学学习的基本功．本文通过求解分式最值问题与证明有关分式不等式,介绍代换的策略．     

对称性在定积分计算中的应用

设f（x）和g（x）在[a,b]上连续,f（x）关于点（（a＋b）／2,c）对称,g（x）关于直线x=（a＋b）／2对称,根据定积分的性质,通过变量代换,可证∫a ^bf（x）g（x）dx=c∫a^bg（x）dx,,该结论及其推论可用以简化定积分计算,实例说明其应用．     

巧用变量代换求解不等式竞赛题

变量代换是一种重要的解题方法,在不等式的证明与求函数最值的竞赛题中,通过分母代换、整体代换、倒数代换、三角代换、增量代换等,可使复杂问题简单化、隐晦特征明朗化,从而找到解题的突破口,下举数例．     

3＋1维声子、电子和光子系统的奇异拉氏量描述

基于约束系统的（Ｄｉｒａｃ）理论，用路径积分量子化方法深入分析了光子－电子－声子系统的量子化，说明了与传统研究之间的关系．     

Topological conjugacy to given constant length substitution minimal systems

We find necessary and sufficient conditions for a symbolic dynamical system to be topologically conjugate to any given constant length substitution minimal system, thus extending the results in Coven et al. (2008) for the Morse and Toeplitz substitutions.     

Li-Yorke and distributionally chaotic operators

We study Li-Yorke chaos and distributional chaos for operators on Banach spaces. More precisely, we characterize Li-Yorke chaos in terms of the existence of irregular vectors. Sufficient “computable” criteria for distributional and Li-Yorke chaos are given, together with the existence of dense scrambled sets under some additional conditions. We also obtain certain spectral properties. Finally, we show that every infinite dimensional separable Banach space admits a distributionally chaotic operator which is also hypercyclic.     

Discrete chaos induced by heteroclinic cycles connecting repellers in Banach spaces

This paper is concerned with chaos induced by heteroclinic cycles connecting repellers for maps in Banach spaces. Several criteria of chaos are established in general Banach spaces and finite-dimensional spaces, respectively, by employing the coupled-expansion theory. All the maps presented in this paper are proved to be chaotic in the sense of both Li-Yorke and Devaney or in the sense of both Li-Yorke and Wiggins or in the sense of Li-Yorke. An illustrative example is provided with computer simulations.     

Topological conjugacy of constant length substitution dynamical systems

Primitive constant length substitutions generate minimal symbolic dynamical systems. In this article we present an algorithm which can produce the list of injective substitutions of the same length that generate topologically conjugate systems. We show that each conjugacy class contains infinitely many substitutions which are not injective. As examples, the Toeplitz conjugacy class contains three injective substitutions (two on two symbols and one on three symbols), and the length two Thue–Morse conjugacy class contains twelve substitutions, among which are two on six symbols. Together, they constitute a list of all primitive substitutions of length two with infinite minimal systems which are factors of the Thue–Morse system.     

一般三角帐篷映射混沌性与两种混沌互不蕴含性

将三角帐篷映射推广为一般的n-三角帐篷映射,并且借助于一般Bernoulli移位映射,Banks定理与Li-Yorke定理,首先证明：对于任意的正整数n,n-三角帐篷映射既是Devaney混沌的,也是Li-Yorke混沌的.然后,利用所得到的结果,通过实例展示：Devaney混沌与Li-Yorke混沌的互不蕴含性.     

关于两种混沌映射的有限乘积性质

首先在一般度量空间上给出有限积映射是Li-Yorke混沌的一个判据,并且用反倒展示:当有限积映射是Li-Yorke混沌时,未必一定存在因子映射是Li-Yorke混沌的.然后,利用上述判据,在[0,1]N上证明有限积映射有不可数scrsmbled集的一个充要条件.进而,推出关于有限积映射为Li-Yorke 混沌的一组等价...     

Recent development of chaos theory in topological dynamics

We give a summary on the recent development of chaos theory in topological dynamics,focusing on Li–Yorke chaos, Devaney chaos, distributional chaos, positive topological entropy, weakly mixing sets and so on, and their relationships.     

瞬时混沌神经网络的混沌动力学

首先利用"不可分意味着混沌"从理论上证明了一维瞬时混沌神经网络在一定的条件下按Li-Yorke意义是混沌的;特别地,进一步推出了混沌神经网络按Li-Yorke意义是混沌的充分条件,而这将从理论上证明Aihara等人通过数值计算所得结论;最后,为说明前面的结论给出了一个例子及其数值计算的结果。     

不含混沌真子系统的Li-Yorke混沌

研究了一类Li-Yorke混沌系统,该系统没有真子系统是Li-Yorke混沌的,我们称之为混沌极小系统.本文证明混沌极小系统是拓扑传递的,而且该系统每个非空开集都包含一个不可数混乱集.混沌极小系统不一定是极小的,本文构造了一个这样的反例.特别地,我们考察了线段连续自映射,指出该类系统都不是混沌极小的,线段上混沌极小子系统的存在性和该系统有正熵是等价的.     

Omega-limit sets and invariant chaos in dimension one

Omega-limit sets play an important role in one-dimensional dynamics. During last fifty year at least three definitions of basic set has appeared. Authors often use results with different definition. Here we fill in the gap of missing proof of equivalency of these definitions. Using results on basic sets we generalize results in paper [P. Oprocha, Invariant scrambled sets and distributional chaos, Dyn. Syst. 24 (2009), no. 1, 31–43.] to the case continuous maps of finite graphs. The Li-Yorke chaos is weaker than positive topological entropy. The equivalency arises when we add condition of invariance to Li-Yorke scrambled set. In this note we show that for a continuous graph map properties positive topological entropy; horseshoe; invariant Li-Yorke scrambled set; uniform invariant distributional chaotic scrambled set and distributionaly chaotic pair are mutually equivalent.