RECONSTRUCTION OF BINARY RELATIONS FROM THEIR RESTRICTIONS OF CARDINALITY 2, 3, 4 and (n - 1) II

We shall prove here that any binary relation on a base E with cardinality n > 6 is reconstructible from its restrictions of cardinality 2, 3, 4 and (n - 1). This proof needs results of part I of this paper where we characterize any pair of relations R, R' which are 2-, 3- and 4-hypomorphic. As a corollary we obtain that any binary relation is (n - 4)-reconstructible (when n > 9).     

二元光学波面变形器件的研究

基于计算全息原理设计了二元光学波面变形器件，一块二元光学器件的衍射效率比计算全息可提高４倍，高斯波面整形需要二块整形光学器件，二元光学器件的激光利用率比计算全息提高１６倍，而且制做工艺简单．     

一类两两NQD列乘积和的Jamison型强稳定性

研究了一类不同分布两两NQD列的Jamison型加权乘积和的强稳定性,推广了不同分布独立列部分和与同分布NQD列部分和情形相类似的结论.     

C_nP_4~4(n=1～7)团簇结构与能量的密度泛函研究

使用分子图形软件设计出多种CnP-4(n =1～ 7)的结构模型 ,并进行B3LYP密度泛函几何构型优化和振动频率计算 .最稳定的CP-4和C2 P-3 都是平面环状结构 .最稳定的CnP-4(n =3 ,5 ,7)结构在直碳链的一端连接 1个磷原子且另一端是P3 C的四元环的平面结构 .最稳定的CnP-4(n =4,6)结构在直碳链的一端连接 1个磷原子且另一端是P3 的三元环的锄状结构 .直碳链可与平面环的磷原子生成大π键 .大多数构型是由C2 ,C3 ,C4子结构以环状或链状方式组成的 .碳原子与磷原子以交替方式排列的结构数量少、能量高 .     

Almost strongly regular matrices and a core theorem for double sequences

The idea of almost convergence for double sequences was introduced by Moricz and Rhoades [Math. Proc. Cambridge Philos. Soc. 104 (1988) 283-294] and they also characterized the four dimensional strong regular matrices. In this paper we define and characterize the almost strongly regular matrices for double sequences and apply these matrices to establish a core theorem.     

含k-次增生算子的Ishikawa迭代的收敛性问题

主要研究了非线性方程x Tx=f的Ishikawa迭代解．其中T为k-次增生的或增生的，并在一致光滑和任意的实Banach空间分别研究了上述方程的带误差的Ishikawa迭代解，从而推广了已知的一些结果。     

激光相干阵列探测中的二元全息光栅

从外差阵列探测出发，围绕木振光束整形问题，就计算全息位相光栅在激光相干雷达系统中的应用进行了理论及实施方面的研究，得出较好的结果。     

布尔矩阵维数的缺断区间(英)

本文证明了n维布尔矩阵维数的一个新的缺断区间为这一结果扩充了一些已知的结论．     

Simple Constructions of Almost k-wise Independent Random Variables

We present three alternative simple constructions of small probability spaces on n bits for which any k bits are almost independent. The number of bits used to specify a point in the sample space is (2 + o(1)) (log log n + k/2 + log k + log 1/?), where ? is the statistical difference between the distribution induced on any k bit locations and the uniform distribution. This is asymptotically comparable to the construction recently presented by Naor and Naor (our size bound is better as long as ? < 1/(k log n)). An additional advantage of our constructions is their simplicity.     

Sigma function solution of the initial value problem for Somos 5 sequences

The Somos 5 sequences are a family of sequences defined by a fifth order bilinear recurrence relation with constant coefficients. For particular choices of coefficients and initial data, integer sequences arise. By making the connection with a second order nonlinear mapping with a first integral, we prove that the two subsequences of odd/even index terms each satisfy a Somos 4 (fourth order) recurrence. This leads directly to the explicit solution of the initial value problem for the Somos 5 sequences in terms of the Weierstrass sigma function for an associated elliptic curve.