对称本原矩阵指数集的刻画

设Ｓｎ表示由全体ｎ阶对称本原（０，１）－矩所构成的集合，并设Ｓ（ｎ，ｄ）＝｛Ａ∈Ｓｎ│Ａ的伴随有向图中的最小奇圈之长为ｄ≥１｝。本文证明了：Ｓ（ｎ，ｄ）的本原指数集为｛ｄ－１，ｄ，…，２ｎ－ｄ－１｝＼Ｄ，其中Ｄ为｛ｎ－ｄ＋１，ｎ－ｄ＋２，…，２ｎ－ｄ－２｝中的所有奇数与０之并集，同时，我们也给出了Ｓ（ｎ，ｄ）中指数达到上界的矩阵集合的完全刻画。     

Information patterns and Nash equilibria in extensive games — II

In Part I of this paper we introduced extensive games with a non-atomic continuum of players. It was shown that the Nash plays (outcomes) are invariant of the information patterns on the game, provided that no player's unilateral change in moves can be observed by others. This led to an enormous reduction in the Nash plays of the these games, as exemplified in the anti-folk theorem. Our concern in this sequel is to develop a finite version of these results.     

关于模N的原根与它的逆的差的奇数幂及其推广

本文研究了模ｎ的原根ａ与它的逆ａ差的奇数幂分布性质，并给出了(?)的一个渐近公式．     

Optimal control of nonlinear evolution equations with nonmonotone nonlinearities

In this paper, we prove the existence of optimal admissible pairs for a large class of strongly nonlinear evolution equations, involving nonmonotone nonlinearities. An example of a nonlinear parabolic optimal control system is also worked out in detail.The author wishes to thank Professor T. S. Angell for useful comments and suggestions.This research was supported by NSF Grant No. DMS-88-02688.     

On a new class of multiplicative pseudo-random number generators

In the computing literature, there are few detailed analytical studies of the global statistical characteristics of a class of multiplicative pseudo-random number generators.We comment briefly on normal numbers and study analytically the approximately uniform discrete distribution or (j,)-normality in the sense of Besicovitch for complete periods of fractional parts {x _{0 1} ⁱ /p} on [0, 1] fori=0, 1,..., (p–1)p^–1–1, i.e. in current terminology, generators given byx _{n+1 1} x _n mod p wheren=0, 1,..., (p–1)p ^–1–1,p is any odd prime, (x ₀,p)=1, ₁ is a primitive root modp ², and 1 is any positive integer.We derive the expectationsE(X, ),E(X ², ),E(X _nX_n+k); the varianceV(X, ), and the serial correlation coefficient k. By means of Dedekind sums and some results of H. Rademacher, we investigate the asymptotic properties of k for various lagsk and integers 1 and give numerical illustrations. For the frequently used case =1, we find comparable results to estimates of Coveyou and Jansson as well as a mathematical demonstration of a so-called rule of thumb related to the choice of ₁ for small k.Due to the number of parameters in this class of generators, it may be possible to obtain increased control over the statistical behavior of these pseudo-random sequences both analytically as well as computationally.     

Compatible associative bialgebras

We introduce a non-symmetric operad 𝒩, whose dimension in degree n is given by the Catalan number c_n?1. It arises naturally in the study of coalgebra structures defined on compatible associative algebras. We prove that any free compatible associative algebra admits a compatible infinitesimal bialgebra structure, whose subspace of primitive elements is a 𝒩-algebra. The data (As,As²,𝒩) is a good triple of operads, in J.-L. Loday’s sense. Our construction induces another triple of operads (As,As₂,As), where As₂ is the operad of matching dialgebras. Motivated by A. Goncharov’s Hopf algebra of paths P(S), we introduce the notion of bi-matching dialgebras and show that the Hopf algebra P(S) is a bi-matching dialgebras.     

基于毕达哥拉斯犹豫模糊距离测度的灰关联双向投影决策法

为解决多属性决策单方向偏差难题所提出的灰关联投影法尚存在适用性差的技术不足。为此,在借鉴双向投影技术要点的基础上联合新型灰关联系数,并引入毕达哥拉斯犹豫模糊集的表达优势,提出基于毕达哥拉斯犹豫模糊距离测度的灰关联双向投影决策方法。新方法能够有效解决毕达哥拉斯犹豫模糊多属性决策问题,具有较高的分辨度。通过算例应用分析,直接验证了毕达哥拉斯犹豫模糊灰关联双向投影方法的实用性,间接验证了毕达哥拉斯犹豫模糊距离测度和灰关联双向投影法的有效性。     

基于广义WOWA算子的Pythagorean模糊决策方法

针对Pythagorean模糊信息的决策问题,构建广义Pythagorean模糊信息加权有序加权平均(PF-GWOWA)算子。首先,提出PF-GWOWA算子,并证明Pythagorean模糊广义加权平均(PF-GWA)算子、Pythagorean模糊加权有序加权平均(PF-WOWA)算子与Pythagorean模糊加权平均(PF-WA)算子均为PF-GWOWA算子的特例;其次,根据GWOWA算子属性综合权重计算模型,利用PF-GWOWA算子对信息进行集结;最后,通过算例分析和传统方法对比,说明本文提出方法的合理性与有效性。     

Ramsey theory on Steiner triples

We call a partial Steiner triple system C (configuration) t‐Ramsey if for large enough n (in terms of $C,t$), in every t‐coloring of the blocks of any Steiner triple system STS(n) there is a monochromatic copy of C. We prove that configuration C is t‐Ramsey for every t in three cases:

• C is acyclic
• every block of C has a point of degree one
• C has a triangle with blocks 123, 345, 561 with some further blocks attached at points 1 and 4

This implies that we can decide for all but one configurations with at most four blocks whether they are t‐Ramsey. The one in doubt is the sail with blocks 123, 345, 561, 147.