非自治Ginzburg-Landau方程的周期解和全局周期吸引子

研究受周期外力影响的非自治Ginzburg-Landau方程的解的长时间行为.首先证明系统在空间H上存在周期解,而且周期解包含在空间V中的一个有界吸收集内.然后证明了当耗散系数λ满足一定条件时,该系统在空间H上具有唯一的周期解,该周期解指数吸引H中的任意有界集.     

l~p空间中的周期边值问题

研究抽象空间微分方程周期解的存在性一直是比较困难的问题 .Deimling,K利用耗散性及紧性条件研究了这一问题解的存在性 [1 - 2 ] .本文从另一个角度研究了赋范线性空间 lp中的周期边值问题解的单调逼近 ,提出了计算解的具体方法 .     

Banach空间中常微分方程的周期解

本文研究Ｂａｎａｃｈ空间中常微分方程的周期解的存在性，在耗散型条件下得到一系列结果。同时，还给出一无穷维微分方程存在周期解的例子。     

一类非自治随机微分方程的均方渐近概周期解

本文研究了一类在可分Hilbert空间中的非自治随机微分方程的均方渐近概周期解.利用"Acquistapace-Terreni"条件,开方族和Banach不动点原理讨论了该类随机微分方程的均方渐近概周期解的存在唯一性,推广了该类随机微分方程的均方概周期解的存在唯一性问题.     

l^p空间中的周期边值问题

研究抽象空间微分方程周期解的存在性一直是比较困难的问题。Deimling，K利用耗散性及紧性条件研究了这一问题解的存在性^[1-2]。本从另一个角度研究了赋范线性空间l^p中的周期边值问题的单调逼近，提出了计算解的具体方法。     

一类积分方程的向量值遥远概周期解

讨论了向量值遥远概周期函数空间上一类积分算子的不变性,并应用此结果对一类积分方程的向量值遥远概周期解的存在唯一性进行了研究,得到了其遥远概周期解存在唯一的一个充分性条件.     

一类随机积分微分方程的伪概周期解

在可分实Hilbert空间考虑一类随机积分微分方程在伪概周期环境下解的存在唯一性问题.基于不动点原理和随机分析技巧,给出了方程存在唯一伪概周期解的一组充分条件.研究表明,如果方程预解算子族指数稳定,即使时滞是无界单调不减函数,在适当的条件下,方程依然存在唯一伪概周期解.最后,给出实例加以验证.     

有序Banach空间非线性二阶周期边值问题解的存在性

在不假定f满足非紧性测度条件及上下解存在的情形下,用算子谱理论与半序方法获得了有序Banach空间E中的非线性二阶周期边值问题■解的存在性结果.     

具有扩散的广义Brusselator系统的Hopf分歧

在齐次Neumann边界条件下,考虑广义Brusselator系统．首先讨论常微分系统Hopf分歧的存在性,得到渐近稳定的周期解．其次讨论具有扩散的偏微分系统,在扩散系数满足一定的条件下,得到超临界的Hopf分歧,并利用规范形理论和中心流形定理给出空间齐次周期解的渐近稳定性．最后,借助Matlab软件进行数值模拟,证明了定理的结论．同时,正平衡态解和空间非齐次周期解的描绘补充了理论分析结果．     

周期系数 Riccati 方程的周期解存在准则

陈省身教授在报告空间曲线的封闭性时,提出了周期系数 Riccati 方程在什么条件下存在实周期解的问题.这个问题的解决,具有重要的理论价值和实践意义.因此很多人不断地从事这方面的研究,但给出的判据大都是充分性的.本文给出几类判定Riccati 方程存在周期解的充要条件.     

Characterizations of the strongly unique best approximations

The purpose of this paper is two folded. First, we present some results on strongly Kolmogorov sets, some of which parallel those for Kolmogorov sets. Secondly, we give two conditions which are sufficient for an element of a strongly Kolmogorov set to be a strongly unique best approximation. Then these conditions are shown to be necessary if additional conditions are imposed on either the norm or the set which we approximate from.     

Empirical study of stochasticity for deterministic chaotical dynamics of geometric progressions of residues

Kolmogorov discovered in 1933 that the empirical statistics of several independent values of any random variable differs from the true distribution function of this variable in some universal way: the random distribution of the distance of one of these statistics from the other verifies (asymptotically) some stochastic distribution law (called later “Kolmogorov’s distribution”). The present paper compares the Kolmogorov’s distribution with a similar object, provided by the chain of observations of a nonrandom, deterministic dynamical system, formed by the consecutive members of a geometrical progression. Say, the Kolmogorov’s distribution is observed for the distribution of the last pairs of digits of the powers of integer 3, that is, for the sequence 01,03,09,27,81,43,29,87,… (which is not random at all and does not verify the Kolmogorov’s theorem conditions).     

Kolmogorov complexity and set theoretical representations of integers

We reconsider some classical natural semantics of integers (namely iterators of functions, cardinals of sets, index of equivalence relations) in the perspective of Kolmogorov complexity. To each such semantics one can attach a simple representation of integers that we suitably effectivize in order to develop an associated Kolmogorov theory. Such effectivizations are particular instances of a general notion of “self‐enumerated system” that we introduce in this paper. Our main result asserts that, with such effectivizations, Kolmogorov theory allows to quantitatively distinguish the underlying semantics. We characterize the families obtained by such effectivizations and prove that the associated Kolmogorov complexities constitute a hierarchy which coincides with that of Kolmogorov complexities defined via jump oracles and/or infinite computations (cf. [6]). This contrasts with the well‐known fact that usual Kolmogorov complexity does not depend (up to a constant) on the chosen arithmetic representation of integers, let it be in any base n ≥ 2 or in unary. Also, in a conceptual point of view, our result can be seen as a mean to measure the degree of abstraction of these diverse semantics. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Carrying simplices in nonautonomous and random competitive Kolmogorov systems

The purpose of this paper is to investigate the asymptotic behavior of positive solutions of nonautonomous and random competitive Kolmogorov systems via the skew-product flows approach. It is shown that there exists an unordered carrying simplex which attracts all nontrivial positive orbits of the skew-product flow associated with a nonautonomous (random) competitive Kolmogorov system.     

Nonlinear Transformations of Evolution Families Generated by Diffusion Processes

We derive closed equations for some nonlinear transformations of solutions to forward and backward Kolmogorov equations (which are parabolic equations with respect to measures and functions). In particular, we obtain closed equations for the logarithmic derivatives of smooth diffusion measures and for the Radon–Nikodym derivatives of a pair of absolutely continuous diffusion measures. Similar results are obtained for the backward Kolmogorov equation. Bibliography: 14 titles.     

Kolmogorov向前向后方程组的概率意义

研究了Kolmogorov向前向后方程组的概率意义,得到正规链满足Kolmogorov向前向后方程组的等价条件,并进一步得到不诚实但全稳定的转移函数对应的带“杀死”的Markov链满足Kolmogorov向前向后方程组的充分必要条件.     

Nonlocal transformations of Kolmogorov equations into the backward heat equation

We extend and solve the classical Kolmogorov problem of finding general classes of Kolmogorov equations that can be transformed to the backward heat equation. These new classes include Kolmogorov equations with time-independent and time-dependent coefficients. Our main idea is to include nonlocal transformations. We describe a step-by-step algorithm for determining such transformations. We also show how all previously known results arise as particular cases in this wider framework.     

The Kolmogorov Problem on Uniqueness of Probability Solutions of a Parabolic Equation

Doklady Mathematics - Abstract—We give a solution to the Kolmogorov problem on uniqueness of probability solutions to a parabolic Fokker–Planck–Kolmogorov equation.     

On the Kolmogorov complexity of continuous real functions

Kolmogorov complexity was originally defined for finitely-representable objects. Later, the definition was extended to real numbers based on the asymptotic behaviour of the sequence of the Kolmogorov complexities of the finitely-representable objects—such as rational numbers—used to approximate them.This idea will be taken further here by extending the definition to continuous functions over real numbers, based on the fact that every continuous real function can be represented as the limit of a sequence of finitely-representable enclosures, such as polynomials with rational coefficients.Based on this definition, we will prove that for any growth rate imaginable, there are real functions whose Kolmogorov complexities have higher growth rates. In fact, using the concept of prevalence, we will prove that ‘almost every’ continuous real function has such a high-growth Kolmogorov complexity. An asymptotic bound on the Kolmogorov complexities of total single-valued computable real functions will be presented as well.     

The Distribution of a Sum of Independent Binomial Random Variables

The distribution of a sum S of independent binomial random variables, each with different success probabilities, is discussed. An efficient algorithm is given to calculate the exact distribution by convolution. Two approximations are examined, one based on a method of Kolmogorov, and another based on fitting a distribution from the Pearson family. The Kolmogorov approximation is given as an algorithm, with a worked example. The Kolmogorov and Pearson approximations are compared for several given sets of binomials with different sample sizes and probabilities. Other methods of approximation are discussed and some compared numerically. The Kolmogorov approximation is found to be extremely accurate, and the Pearson curve approximation useful if extreme accuracy is not required.