光晶格势阱中二元凝聚体的矢量孤子的振荡和分裂

考虑外部囚禁势阱为光晶格势阱,研究了二元玻色-爱因斯坦凝聚体中亮-亮孤子的动力学行为.结果表明,亮-亮孤子的运动方向和振荡行为可以分别通过调节光晶格势阱的晶格常数和势阱深度来控制.进一步地,亮-亮孤子还可以被局域在光晶格势阱中,并且随着势阱深度的增加,局域孤子会产生分裂行为.     

Entire functions sharing an entire function of smaller order with their difference operators

We study a uniqueness question of entire functions order with their difference operators, and deal with a question in this paper extend the corresponding results obtained by Liu Examples are provided to show that the results in this paper, in sharing an entire function of smaller posed by Liu and Yang. The results -Yang and by Liu-Laine respectively. a sense, are the best possible.     

A sufficient condition for planar graphs with maximum degree 8 to be 9-totally colorable

A total k-coloring of a graph G is a coloring of V(G) ∪ E(G) using k colors such that no two adjacent or incident elements receive the same color. The total chromatic number χ'(G) is the smallest integer k such that G has a total k-coloring. It is known that if a planar graph G has maximum degree Δ≥ 9, then χ'(G) = Δ + 1. In this paper, we prove that if G is a planar graph with maximum degree 8 and without a fan of four adjacent 3-cycles, then χ'(G) = 9.     

关于图的3-条件色数

For integers k0,r0,a(k,r)-coloring of a graph G is a proper k-coloring of the vertices such that every vertex of degree d is adjacent to vertices with at least min{d,r}diferent colors.The r-hued chromatic number,denoted byχr(G),is the smallest integer k for which a graph G has a(k,r)-coloring.Define a graph G is r-normal,ifχr(G)=χ(G).In this paper,we present two sufcient conditions for a graph to be 3-normal,and the best upper bound of 3-hued chromatic number of a certain families of graphs.     

一类倒向随机微分方程L~p解对终值的单调连续性

在生成元g满足关于y单调且关于z Lipschitz连续的条件下,范(2007)得到了倒向随机微分方程L~p解对终值的单调连续结果.在g关于y单调且关于z一致连续的条件下证明了倒向随机微分方程L~p解的单调连续性,推广了范(2007)的工作,并且方法是新的.     

星和轮的Mycielski图的[r,s,t]色数

给定非负整数r,s和t,若图G(V,E)有一个映射σ:V∪E→{0,1,…,k-1},k∈N,满足对V中相邻的点v_i,v_j有|σ(v_i)-σ(v_j)|≥r;对E中相邻的边e_i,e_j有|σ(e_i)-σ(e_j)|≥s;对V∪E中相关联的点v_i和边e_j有|σ(v_i)-σ(e_j)|≥t,则称σ为G的一个[r,s,t]-着色.使得图G存在使用了k种颜色的[r,s,t]-着色的最小整数k称为G的[r,s,t]-色数.研究星和轮的Mycielski图的[r,s,t]-着色,并给出其在一定条件下的[r,s,t]-色数.     

联图的关联着色

图G的一个κ-关联着色是指从G的关联集I(G)到颜色集{1,2,…,κ}的一个映射,满足任意一对相邻的关联分配到不同的颜色.使得G有κ-关联着色的最小的数κ称为G的关联色数,记为X_i(G).研究了联图的关联着色,给出了G∨H的关联色数的一个上界,讨论了路与路,路与圈,圈与圈的联图的关联色数.     

涉及小映射的亚纯映射唯一性问题

得到了涉及3n+1个活动小函数的亚纯映射唯一性结果,改进了Fujimoto(1975)和Tu(2002)的定理.     

分数阶撖分方程边值问题正解的存在性及唯一性

根据非线性项的不同,用两个不动点定理研究一类分数阶微分方程正解的存在性及唯一性,且其解可找到迭代序列逼近.最后列举两个例子说明其结果的应用.     

一类拟线性椭圆型方程边值问题的稳定性

在一定条件下证明了一类拟线性椭圆型方程边值问题W~(1,p)(Ω)∩L~∞(Ω)解的存在唯一性,对p≥2及1p≤2两种情形分别在集合收敛与点收敛意义下得到了此类解边值的稳定性.