无限批量调度中最小化加权完工时间和问题的一个线性时间近似方案

本文考虑n个工件的无限批量机器调度问题．一台机器可以同时加工B≥n个工件．每个工件具有一个正权因子、一个释放时间和一个加工时间．一个批次的加工时间是该批次所包含所有工件的加工时间的最大者．在同一批次中加工的工件有相同的完工时间，即它们的共同开始时间加上该批次的加工时间．对于最小化加权完工时间和问题，本文给出了第一个多项式时间近似方案(PTAS)．对任意给定精度，该算法的运行时间为线性的．  

M-纤维式纤维化的特征与诱导M-纤维式纤维化

本文研究了M-纤维式纤维化的问题,利用M-纤维式升腾函数获得了M-纤维式纤维化的特征,以及证明了M-纤维式上纤维化诱导的映射空间之间的M-纤维式映射在一定条件下也是M-纤维式纤维化.  

The Criticality for Circular Coloring of Graph

For two positive integers k and d such that k ≥ 2d, Gkd is the graph with vertex set{0,1,…,k-1} in which ij is an edge if and only ifd ≤ |i-j|≤ k-d. Clearly, Gk1 is acomplete graph of k vertices and we always assume d ≥ 2 in the following.  

The Criticality for Circular Coloring of Graph G_d~k

For two positive integers k and d such that k ≥ 2d, Gkd is the graph with vertex set {0,1, ...,k-1} in which ij is an edge if and only if d ≤ |i-j| ≤ k-d. Clearly, Gk1 is a complete graph of k vertices and we always assume d ≥ 2 in the following. It is easy to see (also [1]) that a graph G is (k, d)-colorable if and only if there exists a homomorphism from G to Gkd.  

齐性空间SU(2n)/Sp(n)的H-同伦指数

令p为大于3的素数.在一定维数限制下,通过把齐性空间SU(2n)/Sp(n)分解为若干个同伦可结合,同伦可交换的H-空间的乘积,进而得到了SU(2n)/Sp(n)的p素H-同伦指数的一个上界.  

A NON-TRIVIAL PRODUCT OF FILTRATION s＋6 IN THE STABLE HOMOTOPY GROUPS OF SPHERES

By a method improving that of [1], the authors prove the existence of a non-trivial product of filtration, s ＋ 6, in the stable homotopy groups of sphere, πt-6S, which is represented up to non-zero scalar by β^-s＋2ho（hmbn-1 -hnbm-1） ∈ ExtA^s＋6,t＋s（Zp, Zp） in the Adams spectral sequence, where p ≥ 7, n ≥ m ＋ 2 ≥ 5, q = 2（p- 1）, 0 ≤ s 〈 p - 2, t= （s ＋ 2 ＋ （s ＋ 2）p ＋ p^m ＋ p^n）q. The advantage of this method is to extend the range of s without much complicated argument as in [1].  

Adams谱序列中的两个非平凡微分

令p≥5为奇素数,研究Adams谱序列的二阶微分d2:Ext*0.