全距置换

利用全距置换的一种等价定义，给出了全距置换的结构与计数的一些性质，同时利用共轭变换得出了一种由已知全距置换构造新的全距置换的方法．并通过计算机计算得出了16阶以下(含16阶)的所有全距置换(共2849470个)．     

Super-edge-graceful Labelings of Some Cubic Graphs

The notion of super-edge-graceful graphs was introduced by Mitchem and Simoson in 1994.However, few examples except trees are known. In this paper, we exhibit two classes of infinitely many cubic graphs which are super-edge-graceful. A conjecture is proposed.     

第二小阶数的双本原半对称图

如果一个正则图是边传递但不是点传递的,那么我们称它是半对称的.每一个半对称图X必定是两部分点数相等的二部图,并且它的自同构群Aut(X)在每一部分上是传递的.如果一个半对称图的自同构群在每一部分上作用是本原的,那么我们称它是双本原的.本文决定了第二小阶数的双本原半对称图.     

Signed words and permutations, I: A fundamental transformation

The statistics major index and inversion number, usually defined on ordinary words, have their counterparts in signed words, namely the so-called flag-major index and flag-inversion number. We give the construction of a new transformation on those signed words that maps the former statistic onto the latter one. It is proved that the transformation also preserves two other set-statistics: the inverse ligne of route and the lower records.

     

Quasi-random 2- colorings of point sets

Given an arbitrary set of N points on the plane, one can two-color the points red and blue in such a way that the difference of the numbers of red and blue points in any half-plane has absolute value less than N^1/4(log N)⁴. This is essentially best possible.     

THE PERMUTATION FORMULA OF SINGULAR INTEGRALS WITH BOCHNER-MARTINELLI KERNEL ON STEIN MANIFOLDS

Using the method of localization, the authors obtain the permutation formula of singular integrals with Bochner-Martinelli kernel for a relative compact domain with C(1) smooth boundary on a Stein manifold. As an application the authors discuss the regularization problem for linear singular integral equations with Bochner-Martinelli kernel and variable coefficients; using permutation formula, the singular integral equation can be reduced to a fredholm equation.     

关于Z／mZ上置换多项式向量组的一个注记

设ｍ和ｎ是两个正整数，Ｒ＝Ｚ／ｍＺ是整数模ｍ剩余类环．设ｎ个多项式ｆｊ（ｘ１，…，ｘｎ）∈Ｒ［ｘ１，…，ｘｎ］，ｊ＝１，…，ｎ，若对任给的（ａ１，…，ａｎ）∈Ｒｎ，同余式组ｆｊ（ｘ１，…，ｘｎ）≡ａｊ（ｍｏｄｍ），ｊ＝１，…，ｎ，恰有一个解，则称ｆ１，…，ｆｎ是一组置换多项式向量模ｍ．一个自然的问题是：Ｒ上哪些ｎ元多项式可以扩充为一组置换多项式向量模ｍ？本文解决了这一问题，并给出了一个充分必要条件．     

广义严格对角占优阵的判定程序

1 引言和符号 在本文中,均采用下列符号而不再重申.恒用N表示前n个自然数的集合;而用Mn(C)和Mn(R)分别表示所有n阶复矩阵和所有n阶实矩阵的集合. Z_N={A|A=(a_(ij))_(n×n)∈Mn(R),a_(ij)≤0,i,j∈N,i≠j},I恒表示单位矩阵. 如果A∈Mn(R)且A的所有元素都为非负实数,则称A为非负方阵,并记为A≥0;若A的所有元素都为正数,则称A为正矩阵,并记为A>0. 对A=(a_(ij))(n×n)∈Mn(C),令A_i(A)=sum from j=1 j≠i to n (|a_(ij)|(i=1、2…… n)) ;若把A的非零元用1代替 而得到—个n阶(0,1)矩阵。称为A的导出矩阵。记为;而把A的比较矩阵记为 u(A)=(b_(ij))_(n×n))其中b_(ij)=|a_(ij)|,b_(ij)=-|a_(ij)|(i,j∈N i≠j)     

Johnson法则在成组加工排序中的推广

成组技术（Group Technology）是把工件分组进行加工,以提高生产效率的一种生产组织方法,本文把两台机器同序作业（同顺序流水作业）排序问题F2│perm│C_(max)的John-son法则推广到成组加工上,提出确定组与组之间顺序的最优法则,给出了这个问题成组加工的最优排法,并分析算法的计算复杂性。     

完美置换和空间均衡拉丁方北大核心CSCD

本文首次提出完美置换的概念并研究它的代数性质和构造方法,解决了2n+1为素数时n阶完美置换的存在性.我们还利用完美置换给出了循环空间均衡拉丁方和对称空间均衡拉丁方的构造方法,它们在试验设计中有广泛的应用。