模糊关系矩阵传递闭包的Warshall算法

通过对照关系的传递闭包和模糊关系的传递闭包，把求关系矩阵的传递闭包的算法完整地推广到模糊关系矩阵上。     

One-Element Extensions in the Variety Generated by Tournaments

We investigate congruences in one-element extensions of algebras in the variety generated by tournaments.     

赋权矩阵及其性质

本文给出了以S为行权和向量的权矩阵类T_＋(S)中每个权矩阵都可逆的一个充要条件．     

LA RECONSTRUCTION DES TOURNOIS SANS DIAMANT

We prove that if T is a tournament of order n > 6 in which any 4-sub-tournament is hamiltonian or transitive, then T is reconstructible in the sense of Ulam.     

Structure theorem for tournaments omitting N5

A finite tournament T is tight if the class of finite tournaments omitting T is well‐quasi‐ordered. We show here that a certain tournament N₅ on five vertices is tight. This is one of the main steps in an exact classification of the tight tournaments, as explained in [10]; the third and final step is carried out in [11]. The proof involves an encoding of the indecomposable tournaments omitting N₅ by a finite alphabet, followed by an application of Kruskal's Tree Theorem. This problem arises in model theory and in computational complexity in a more general form, which remains open: the problem is to give an effective criterion for a finite set {T₁,…,T_k} of finite tournaments to be tight in the sense that the class of all finite tournaments omitting each of T₁,…,T_k is well‐quasi‐ordered. © 2003 Wiley Periodicals, Inc. J Graph Theory 42: 165–192, 2003     

一般关系下的n-阶FC-粗糙集模型

给出一般模糊环境下n阶-FC-粗糙近似算子的定义,讨论它的一些性质,并通过α-水平集给出各种n-阶模糊粗糙集的表示。进而给出模糊传递闭包近似算子的定义,得到相应的结果。     

福建省首届大学生化学实验邀请赛无机及分析化学实验试题解析

介绍了福建省首届大学生化学实验邀请赛无机及分析化学实验的命题思路、试题原题及评分规则,并对实验中存在的问题及成绩进行了总结分析。     

A lower bound on the size of an absorbing set in an arc-coloured tournament

Bousquet, Lochet and Thomassé recently gave an elegant proof that for any integer $n$, there is a least integer $f\left(n\right)$ such that any tournament whose arcs are coloured with $n$ colours contains a subset of vertices $S$ of size $f\left(n\right)$ with the property that any vertex not in $S$ admits a monochromatic path to some vertex of $S$. In this note we provide a lower bound on the value $f\left(n\right)$.     

Intransitive Permutation Group with Bounded Movement

Let G be a intransitive permutation group on a set with no fixed point in ; let m, n be a positive integer and let |^g – | m, for every and g G. When G has t orbits and degree n close to [2mp/(p – 1)] + t – 1, this paper constructs such a group with m close to [n(p – 1)/2p].AMS Subject Classification: 20BXX.     

Small Transitive Families of Subspaces

A family of subspaces of a complex separable Hilbert space is transitive if every bounded operator which leaves each of its members invariant is scalar. This article surveys some results concerning transitive families of small cardinality, and adds some new ones. The minimum cardinality of a transitive family in finite dimensions (greater than 2) is 4. In infinite dimensions a transitive pair of linear manifolds exists but the minimum cardinality of a transitive family of dense operator ranges or norm-closed subspaces is not known. However, a transitive family of dense operator ranges with 5 elements can be found, and so can a transitive family of norm-closed subspaces with 4 elements. In finite dimensions (> 1) three nest algebras (corresponding to maximal nests) can intersect in the scalar operators, but two cannot. It is not known if this is the case in infinite dimensions for maximal nests of type ω + 1. Four such nest algebras can intersect in the scalar operators. Received June 15, 2002, Accepted November 27, 2002