m-aryn-cube网络的最优路由

基于可选邻接点的概念,在m-ary n-cube网络中提出一种新的最优寻径算法.这种算法始终在当前结点的可选邻接点中选取最空闲邻接点作为下一个信息传输点.该算法使得从源结点到达目的结点路由是最短路由也是最快速路由,而且在多项式时间内可以完成.     

θ*r,s,t-图与唯一2-列表染色图的特征化

如果一个图G存在一个k-列表安排使得G具有一个唯一列表染色,则称 G是唯一列表可染色图,简称UkLC图．我们称图G具有M(k)性质当且仅当G不 是UkLC图．本文在借鉴θr,s,t-图概念的基础上引入θr,s,t-图的定义,并证明:除了 r=s=t=2以外,θr,s,t-图都是U2LC图．利用如上结果我们给出M．Mahdian and E．S．Mahmoodian对U2LC图所作特征化的一个简单证明．     

反超图的笛卡儿积的上色数

讨论反超图的笛卡儿积的着色理论 ,求出了满足一定条件的反超图的笛卡儿积的上色数 .     

Solution Transformations and Their Effects on the Systems with Open Boundary Conditions

The solution transformations and properties of the R-matrices for two-component systems under these transformations are analyzed in details.Not all transformed R-matrices can be put into the Skalyanin‘s formalism.For those R-matrices with all required properties,the effects of solution transformations to the six-and eight-vertex systems with open boundary conditions are discussed.these effects can be one of the following types:the Hamiltonian is invariant or transposition-invariant or made in a similarity transformation,or its coupling coefficients are multiplied by an overall factor,or the spin of the system is rotated around the z axis or/and reflected with respect to some plane.In these cases,the transformed systems remain to be integrable.     

Coloring mixed hypertrees

A mixed hypergraph is a triple (V,C,D) where V is its vertex set and C and D are families of subsets of V, called C-edges and D-edges, respectively. For a proper coloring, we require that each C-edge contains two vertices with the same color and each D-edge contains two vertices with different colors. The feasible set of a mixed hypergraph is the set of all k's for which there exists a proper coloring using exactly k colors. A hypergraph is a hypertree if there exists a tree such that the edges of the hypergraph induce connected subgraphs of the tree.We prove that feasible sets of mixed hypertrees are gap-free, i.e., intervals of integers, and we show that this is not true for precolored mixed hypertrees. The problem to decide whether a mixed hypertree can be colored by k colors is NP-complete in general; we investigate complexity of various restrictions of this problem and we characterize their complexity in most of the cases.     

关于Gerber不等式的一个猜想

本文证明了陈计-单墫关于Ｇｅｒｂｅｒ不等式的一个猜想，作为其应用，导出了单形内一点到顶点的距离与到面的距离的两个不等式．     

具有唯一4度最大度点的图的全色数

一个图Ｇ的全色数χ_T（Ｇ）是使得Ｖ（Ｇ）∪Ｅ（Ｇ）中相邻或相关联元素均染不同颜色的最少颜色数．文中证明了，若图Ｇ只有唯一的一个４度最大度点，则χ_T（Ｇ）＝Δ（Ｇ）＋１．     

Hamiltonian formulation of generalized quantum dynamics

The Hamiltonian formulation of the usual complex quantum mechanics in the theory of generalized quantum dynamics is discussed. After the total trace Lagrangian, total trace Hamiltonian and two kinds of Poisson brackets are introduced, both the equations of motion of some total trace functionals which are expressed by total trace Poisson brackets and the equations of motion of some operators which are expressed by the without-total-trace Poisson brackets are obtained. Then a set of basic equations of motion of the usual complex quantum mechanics are obtained, which are also expressed by the Poisson brackets and total trace Hamiltonian in the generalized quantum dynamics. The set of equations of motion are consistent with the corresponding Heisenberg equations. Project supported by Prof. T.D. Lee’s NNSC Grant, the National Natural Science Foundation of China, the Foundation of Ph. D. Directing Programme of Chinese University, and the Chinese Academy of Sciences.