非均匀介质中离散Fisher-KPP方程广义行波的稳定性和唯一性

本文研究具有一般时间和空间依赖性离散Fisher-KPP(Kolmogorov-Petrovsky-Piskunov简写为KPP)方程广义行波的稳定性和唯一性.首先证明此类方程严格正整体解的存在性、唯一性和稳定性;接着建立连接此唯一严格正整体解和平凡零解的广义行波的稳定性和唯一性.应用广义行波的一般性稳定性和唯一性理论,本文进而证明时间和空间周期介质中离散Fisher-KPP方程周期行波解的存在性、稳定性和唯一性,以及时间非均匀介质中离散Fisher-KPP方程广义行波的存在性、稳定性和唯一性.本文所建立的一般性稳定性和唯一性理论表明在很多情形下得到的广义行波在合适的扰动下是渐近稳定的.     

一个带非局部源的反应扩散方程组解的存在性和渐近性态

本文研究带非局部源的半线性反应扩散方程组,并通过建立比较定理,利用Schauder不动点定理证明古典解的存在唯一性,得到了解的爆破点集与解的渐近性态.     

带小扰动的随机发展方程的不变测度

本文考虑带小扰动的随机发展方程,证明如何建立此方程的耦合解.作为应用,我们证明解的Feller连续性和不变测度的存在唯一性.还进一步建立了当扰动趋于零时,关于这族不变测度的大偏差原理.     

源于DNA的非线性波动方程组的Cauchy问题(英文)

本文首先证明源于DNA的非线性波动方程组的周期边值问题局部古典解的存在性和唯一性.其次通过周期边值问题序列证明这个方程组的Cauchy问题存在唯一的局部古典解.     

带有环境因素的资产模型

在已有的资产模型基础上,加入了环境因素,建立了一个非线性偏微分方程组,并利用特征线法求得了方程的解析解.利用初等计算,把求解原方程解的存在唯一性转化为积分方程解的存在唯一性,再应用逐次逼近和Gronwall不等式得到积分方程解的存在唯一性.由前面的结论,通过证明指出资产存量是关于环境资产存量单调增的结论.     

具有拟H(o)lder连续生成元的倒向随机微分方程的可积解

本文证明了具有可积参数的一维倒向随机微分方程解的一个新的存在唯一性结果,其中生成元g关于y满足Osgood条件且关于z是拟H(o)lder连续的(这里可以不是H(o)lder连续的).利用Tanaka公式及Girsanov变换建立BSDE的L1解的一个比较定理,从而得到解的唯一性.利用单调逼近方法给出生成元g的一个一致逼近序列进而构造出BSDE的L1解的一个序列,然后证明其极限即为所需的解,从而证明解的存在性.     

二阶拟线性混合(椭圆一双曲)型方程的Frankl问题

本文证明了一类二阶拟线性混合型方程Frankl边值问题解的唯一性与存在性.文中先给出解的一种表示式,据此证明边值问题解的唯一性.进而求得解的估计式,据此再使用复分析理论与"参数开拓法”证明了边值问题解的存在性.这里使用的方法有别于其他作者对混合型方程通常使用的积分方程方法.     

M/M~B/1排队模型的时间依赖解的存在唯一性

应用线性算子的积分半群理论证明 M/MB/1排队模型的时间依赖解的存在唯一性 ,其次推出 M/M/1排队模型的时间依赖解的存在唯一性 .     

带对数阻尼项的对数型类波方程解的整体存在性与爆破

本文研究一类带对数阻尼项的对数型类波方程的柯西问题,考虑对数阻尼项对解存在性的影响.通过Fourier变换、Laplace变换及Young不等式建立了线性问题解的衰减估计.在恰当的工作空间中,利用整体迭代方法证明了解的整体存在唯一性;利用测试函数方法得到了解的有限时刻爆破.     

一类高阶非线性波动方程解的存在性

研究一类高阶非线性波动方程的初边值问题 ,证明问题局部广义解的存在性、唯一性 ,并用凸性方法证明解爆破的充分条件 .     

Ritz and harmonic Ritz values and the convergence of FOM and GMRES

The Ritz and harmonic Ritz values are approximate eigenvalues, which can be computed cheaply within the FOM and GMRES Krylov subspace iterative methods for solving non‐symmetric linear systems. They are also the zeros of the residual polynomials of FOM and GMRES, respectively. In this paper we show that the Walker–Zhou interpretation of GMRES enables us to formulate the relation between the harmonic Ritz values and GMRES in the same way as the relation between the Ritz values and FOM. We present an upper bound for the norm of the difference between the matrices from which the Ritz and harmonic Ritz values are computed. The differences between the Ritz and harmonic Ritz values enable us to describe the breakdown of FOM and stagnation of GMRES. Copyright © 1999 John Wiley & Sons, Ltd.     

Diversity and Popularity in Organizations and Communities

This paper examines social groupings whose structure depends only on the distribution of ability to attract attention. When people‘s attention is a scarce resource, those individuals who are rated highest by a large number of other individuals will have to ration their attention, resulting in constraints on the social structure of the group. The incidence of popular individuals by that definition reflects the extent to which individuals agree on who their highest-rated colleague is. We propose three basic distributions or ways to generate the matrix of perceived ability so as to yield popularity profiles that can be parametrically adjusted to match observations. We demonstrate that each of these assumption sets leads to a slightly different correlation between the value of the assumption‘s parameter and the set of observable popularity patterns. Since popularity, in real life, often determines such things as power, centrality, over-utilization and perhaps reduced accessibility, having more realistic ways of representing it is important for modeling and understanding virtual organizations and communities.     

Singular quasilinear and Hessian equations and inequalities

We solve the existence problem in the renormalized, or viscosity sense, and obtain global pointwise estimates of solutions for quasilinear and Hessian equations with measure coefficients and data, including the following model problems:

     

Polytopes and arrangements: Diameter and curvature

We introduce a continuous analogue of the Hirsch conjecture and a discrete analogue of the result of Dedieu, Malajovich and Shub. We prove a continuous analogue of the result of Holt and Klee, namely, we construct a family of polytopes which attain the conjectured order of the largest total curvature.     

E—matrices and Several Necessary and Sufficient Conditions

AER-x.,Aiscalledanonnegative(nonPositive)matrixifau>O(a,jO(aiirtO),markedA>O(AO(i#j),auO,wecallp(A)=max{IA,l,lA,l'.-.,lAnl},(whereA,,A2,..',A"areeigenva1ueofA)asspectralradiusofA.LemmalIfAe7'.,thenareanonnegativesquarematrxBandapositivenumberksuchthatA=B-kI(whereIistheidentitymatrixofordern).ProofLetbti=…     

Proper and Unit Trapezoid Orders and Graphs

We show that the class of trapezoid orders in which no trapezoid strictly contains any other trapezoid strictly contains the class of trapezoid orders in which every trapezoid can be drawn with unit area. This is different from the case of interval orders, where the class of proper interval orders is exactly the same as the class of unit interval orders.     

Vertex- and edge-minimal and locally minimal graphs

Given a family of graphs , a graph is called edge-minimal (vertex-minimal) if for every subgraph (induced subgraph) G^′ of G; furthermore, G is called locally edge-minimal (locally vertex-minimal) if whenever G^′ is obtained from G by deleting an edge (a vertex). Similarly, the concepts of minimality and local minimality are introduced for directed graphs (digraphs) and, more generally, for partially ordered sets.For example, by the Strong Perfect Graph Theorem, the only vertex-minimal graphs with χ>ω are odd holes and anti-holes. In contrast, the only locally vertex-minimal graphs with χ>ω are partitionable graphs. Somewhat surprisingly, there are infinitely many non-trivial perfect graphs that are locally edge-minimal and -maximal simultaneously. In other words, such a graph is perfect but it becomes imperfect after any edge is deleted from or added to it.In this paper we consider vertex- and edge-minimal and locally minimal graphs in the following families: (i) perfect and imperfect graphs, (ii) graphs with χ=ω and with χ>ω, (iii) digraphs that have a kernel and kernel-free digraphs, and finally, (iv) vertex-minimal complementary connected d-graphs.     

Crossings and nestings of matchings and partitions

We present results on the enumeration of crossings and nestings for matchings and set partitions. Using a bijection between partitions and vacillating tableaux, we show that if we fix the sets of minimal block elements and maximal block elements, the crossing number and the nesting number of partitions have a symmetric joint distribution. It follows that the crossing numbers and the nesting numbers are distributed symmetrically over all partitions of , as well as over all matchings on . As a corollary, the number of -noncrossing partitions is equal to the number of -nonnesting partitions. The same is also true for matchings. An application is given to the enumeration of matchings with no -crossing (or with no -nesting).

     

Fibonacci and Lucas congruences and their applications

In this paper we obtain some new identities containing Fibonacci and Lucas numbers. These identities allow us to give some congruences concerning Fibonacci and Lucas numbers such as L _2mn+k ≡ (−1)^(m+1)n L _k (mod L _m ), F _2mn+k ≡ (−1)^(m+1)n F _k (mod L _m ), L _2mn+k ≡ (−1) ^mn L _k (mod F _m ) and F _2mn+k ≡ (−1) ^mn F _k (mod F _m ). By the achieved identities, divisibility properties of Fibonacci and Lucas numbers are given. Then it is proved that there is no Lucas number L _n such that L _n = L ₂ ^k t L _m x ² for m > 1 and k ≥ 1. Moreover it is proved that L _n = L _m L _r is impossible if m and r are positive integers greater than 1. Also, a conjecture concerning with the subject is given.