NA列加权乘积和的完全收敛性

本文讨论了NA和几类加权部分和及加权乘积和的完全收敛性，其中部分结果要优于iid列的已知结论。     

若干图类的邻强边染色

研究了若干图类的邻强边染色 .利用在图中添加辅助点和边的方法 ,构造性的证明了对于完全图 Kn和路 Lm 的笛卡尔积图 Kn× Lm,有χ′as(Kn× Lm) =△ (Kn× Lm) +1 ,其中△ (Kn× Lm)和χ′as(Kn× Lm)分别表示图 Kn× Lm的最大度和邻强边色数 .同理验证了 n阶完全图 Kn的广义图 K(n,m)满足邻强边染色猜想 .     

4一致反超图的最小边数问题

混合超图是在超图的基础上添加一个反超边得到的图．超边和反超边的区别主要体现在着色要求上．在着色中,要求每一超边至少要有两个点着不同的颜色,而每一反超边至少有两个点着相同的颜色．最大最小颜色数分别称为混合超图的上色数和下色数。本文主要研究反超图,即只含反超边的超图。讨论了上色数为3的4一致超图的最小边数问题．给出了上色数为3的4一致反超图的最小边数的一个上界和一个下界．     

Three types of maximally entangled states for a two-particle system

Foratwo-particle(spin1/2)systemthespinstateisdescribedusingavectorinafour-dimensionalHilbertspace.Inangularmomentumcouplingtheory[1],theangularmomentumuncouplingandcouplingrepresentationsareusuallyadopted.WhilethesimultaneouseigenstatesoftheCSCO(s1z,s2z),12,12,12and12,arechosenasthebasisofangularmomentumuncouplingscheme,thesimultaneouseigenstatesoftheCSCO(2,zSS),,SM(12=+Sss),arechosenasthebasisofangularmomentumcouplingscheme,1212100,2轾=-臌1212110,2轾=+臌121211,1,1.=-=Thefo…     

Cr3+：MgAl2O4晶体EPR参量及其电子精细光谱的研究

考虑了SS(Spin-Spin)作用和SOO(Spin-Other-Orbit)作用，采用完全对角化方法，结合自旋Hamiltonian理论，研究了Cr³⁺∶MgAl₂O₄晶体EPR参量及其吸收光谱，理论与实验符合甚好. 在此基础上，进一步研究了⁴A₂(3d³)离子EPR参量的微观起源. 研究表明，EPR参量起源于四种微观机制：(1) SO(Spin-Orbit) 耦合机制；(2) SS耦合机制；(3)SOO耦合机制；(4) SO～SS～SOO总联合作用机制. 在这些机制中，SO机制是最主要的.     

Halin-图的点强全染色

图G(V,E)的一个k-正常全染色f叫做一个k-点强全染色当且仅当对任意v∈V(G), N[v]中的元素被染不同色,其中N[v]={u|uv∈V(G)}∪{v}．χTvs(G)=min{k|存在图G的k- 点强全染色}叫做图G的点强全色数．对3-连通平面图G(V,E),如果删去面fo边界上的所有点后的图为一个树图,则G(V,E)叫做一个Halin-图．本文确定了最大度不小于6的Halin- 图和一些特殊图的的点强全色数XTvs(G),并提出了如下猜想:设G(V,E)为每一连通分支的阶不小于6的图,则χTvs(G)≤△(G) 2,其中△(G)为图G(V,E)的最大度．     

Investigation of Scale Exponents of Complete and Incomplete Aggregation-Annihilation Processes

The complete and incomplete aggregation-annihilation processes are investigated with the method of generating function, and the scale exponents are obtained exactly. We find that the scale exponents of incomplete aggregation-annihilation process are different from the previous exponents obtained by different methods. The time dependence of the total number of clusters and the total mass of clusters are analytically obtained.     

Partitioning series-parallel multigraphs into ν *-excluding edge covers

We prove that, for any given vertex ν* in a series-parallel graph G, its edge set can be partitioned into κ = min{κ′(G) + 1, δ(G)} subsets such that each subset covers all the vertices of G possibly except for ν*, where δ(G) is the minimum degree of G and κ′(G) is the edge-connectivity of G. In addition, we show that the results in this paper are best possible and a polynomial time algorithm can be obtained for actually finding such a partition by our proof.