Perfect 1‐Factorizations of a Family of Cayley Graphs

A 1‐factorization of a graph G is a decomposition of G into edge‐disjoint 1‐factors (perfect matchings), and a perfect 1‐factorization is a 1‐factorization in which the union of any two of the 1‐factors is a Hamilton cycle. We consider the problem of the existence of perfect 1‐factorizations of even order 4‐regular Cayley graphs, with a particular interest in circulant graphs. In this paper, we study a new family of graphs, denoted , which are Cayley graphs if and only if k is even or . By solving the perfect 1‐factorization problem for a large class of graphs, we obtain a new class of 4‐regular bipartite circulant graphs that do not have a perfect 1‐factorization, answering a problem posed in 7 . With further study of graphs, we prove the nonexistence of P1Fs in a class of 4‐regular non‐bipartite circulant graphs, which is further support for a conjecture made in 7 .     

NONCOMMUTATIVE ORLICZ-HARDY SPACES

Let(Φ, Ψ) be a pair of complementary N-functions and HΦ(A) and HΨ(A) be the associated noncommutative Orlicz-Hardy spaces. We extend the Riesz, Szeg and innerouter type factorization theorems of Hp(A) to this case.     

工件的释放时间和加工时间具有一致性的单机在线排序问题研究

工件的释放时间和加工时间具有一致性, 是指释放时间大的工件其加工时间不小于释放时间小的工件的加工时间, 即若$r_{i}\geq r_{j}$, 则$p_{i}\geq p_{j}$。本文在该一致性约束下, 研究最小化最大加权完工时间单机在线排序问题, 和最小化总加权完工时间单机在线排序问题, 并分别设计出$\frac{\sqrt{5}+1}{2}$-竞争的最好可能在线算法。     

New convolutions and their applicability to integral equations of Wiener-Hopf plus Hankel type

We propose four new convolutions exhibiting convenient factorization properties associated with two finite interval integral transformations of Fourier-type together with their norm inequalities. Moreover, we study the solvability of a class of integral equations of Wiener-Hopf plus Hankel type (on finite intervals) with the help of the factorization identities of such convolutions. Fourier-type series are used to produce the solution formula of such equations, and a Shannon-type sampling formula is also obtained.     

高能π–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.