高能π–p碰撞J/ψ+γ硬衍射产生

用I–S模型与夸克偶素的色八重态产生机制,对πp碰撞J/ψ+γ协同产生的单衍射过程的微分截面及总截面进行计算,结果表明,把J/ψ+γ协同产生的单衍射过程和单举过程相结合,可以探测Pomeron中的胶子成分并对硬衍射因子化进行检验.     

Makarov势的Dirac方程的束缚态解

给出了Makarov型标量势与矢量势相等条件下的Dirac方程的束缚态解. Dirac方程的角向方程用因子分解方法求解，在得出角向波函数的过程中，自然地得到了属于同一本征值的不同角向波函数间的递推操作. 径向束缚态波函数用合流超几何函数表示，束缚态的能量方程可由径向波函数满足的边界条件得到. 关键词： Makarov势 Dirac方程 束缚态 因子分解方法     

Phenomenological applications of<Emphasis Type="Italic">k</Emphasis><Subscript>T</Subscript>factorization

We discuss applications of the perturbative QCD approach in the exclusive non-leptonic two-bodyB-meson decays. We briefly review its ingredients and some important theoretical issues on the factorization approach. PQCD results are compatible with present experimental data for charmless B-meson decays. We predict the possibility of large direct CP asymmetry in B⁰ → π⁺π⁻ (23 +7%) and B⁰ →K ⁺π⁻ (− 17 ± 5%). We also investigate the branching ratios, CP asymmetry and isospin symmetry breaking in radiativeB →(K*/ρ)γ decays.     

非因子化方法研究D~+→ ■~0K~+衰变(英文)

在领头阶和αs 修正阶 ,用QCD因子化方法 ,并对它的软胶子效应用光锥QCD求和规则分析D+ → K0 K+ 衰变过程 ,我们分析发现朴素因子化方法的结果远离实验结果 ,QCD因子化方法结果靠近实验结果 ,但是 ,在QCD因子化方法中 ,若考虑软胶子效应 ,其结果与实验结果相一致 .另外 ,计算发现 ,软胶子效应在该衰变道中有相当大的贡献 ,因此不能被忽略     

The generalized triangular decomposition

Given a complex matrix , we consider the decomposition , where is upper triangular and and have orthonormal columns. Special instances of this decomposition include the singular value decomposition (SVD) and the Schur decomposition where is an upper triangular matrix with the eigenvalues of on the diagonal. We show that any diagonal for can be achieved that satisfies Weyl's multiplicative majorization conditions:

where is the rank of , is the -th largest singular value of , and is the -th largest (in magnitude) diagonal element of . Given a vector which satisfies Weyl's conditions, we call the decomposition , where is upper triangular with prescribed diagonal , the generalized triangular decomposition (GTD). A direct (nonrecursive) algorithm is developed for computing the GTD. This algorithm starts with the SVD and applies a series of permutations and Givens rotations to obtain the GTD. The numerical stability of the GTD update step is established. The GTD can be used to optimize the power utilization of a communication channel, while taking into account quality of service requirements for subchannels. Another application of the GTD is to inverse eigenvalue problems where the goal is to construct matrices with prescribed eigenvalues and singular values.

     

Doubly transitive 2‐factorizations

Let be a 2‐factorization of the complete graph K_v admitting an automorphism group G acting doubly transitively on the set of vertices. The vertex‐set V(K_v) can then be identified with the point‐set of AG(n, p) and each 2‐factor of is the union of p‐cycles which are obtained from a parallel class of lines of AG(n, p) in a suitable manner, the group G being a subgroup of A G L(n, p) in this case. The proof relies on the classification of 2‐(v, k, 1) designs admitting a doubly transitive automorphism group. The same conclusion holds even if G is only assumed to act doubly homogeneously. © 2006 Wiley Periodicals, Inc. J Combin Designs     

一类非线性微分方程解的因式分解

本文讨论（１．６）的解ｗ（ｚ）的因式分解并给出ｗ（ｚ）的右因式和左因式的某些性质。     

Kp,q-factorization of complete bipartite graphs

Let K_(m,n) be a complete bipartite graph with two partite sets having m and nvertices, respectively. A K_(p,q)-factorization of K_(m,n) is a set of edge-disjoint K_(p,q)-factorsof K_(m,n) which partition the set of edges of K_(m,n). When p=i and q is a prime number,Wang, in his paper "On K_(1,k)-factorizations of a complete bipartite graph" (Discrete Math,1994, 126; 359-364), investigated the K_(1,q)-factorization of K_(m,n) and gave a sufficientcondition for such a factorization to exist. In the paper "K_(1,k)-factorizations of completebipartite graphs" (Discrete Math, 2002, 259: 301-306), Du and Wang extended Wang'sresult to the case that q is any positive integer In this paper, we give a sufficient conditionfor K_(m,n) to have a K_(p,q)-factorization. As a special case, it is shown that the Martin's BACconjecture is true when p: q=k: (k+1) for any positive integer k.     

Kp,q-factorization of complete bipartite graphs

Let K _m,nbe a complete bipartite graph with two partite sets having m and n vertices, respectively. A K _p,q-factorization of K _m,n is a set of edge-disjoint K _p,q-factors of K _m,n which partition the set of edges of K _m,n. When p = 1 and q is a prime number, Wang, in his paper “On K _1,k -factorizations of a complete bipartite graph” (Discrete Math, 1994, 126: 359—364), investigated the K _1,q -factorization of K _m,nand gave a sufficient condition for such a factorization to exist. In the paper “K _1,k -factorizations of complete bipartite graphs” (Discrete Math, 2002, 259: 301—306), Du and Wang extended Wang’s result to the case that q is any positive integer. In this paper, we give a sufficient condition for K _m,n to have a K _p,q-factorization. As a special case, it is shown that the Martin’s BAC conjecture is true when p : q = k : (k+ 1) for any positive integer k.