几种模糊传递关系的收敛性

本文对几种模糊传递关系进行比较 ,从一个侧面说明了用于构造偏好关系的模糊关系应是互逆关系 .文中证明了对任意的 n阶互逆传递模糊关系 R,必有 Rn=Rn+1 .     

Innately transitive subgroups of wreath products in product action

A permutation group is innately transitive if it has a transitive minimal normal subgroup, which is referred to as a plinth. We study the class of finite, innately transitive permutation groups that can be embedded into wreath products in product action. This investigation is carried out by observing that such a wreath product preserves a natural Cartesian decomposition of the underlying set. Previously we classified the possible embeddings in the case where the plinth is simple. Here we extend that classification and identify several different types of Cartesian decompositions that can be preserved by an innately transitive group with a non-abelian plinth. These different types of decompositions lead to different types of embeddings of the acting group into wreath products in product action. We also obtain a full characterisation of embeddings of innately transitive groups with diagonal type into such wreath products.

     

Two-Arc Transitive Graphs and Twisted Wreath Products

The paper addresses a part of the problem of classifying all 2-arc transitive graphs: namely, that of finding all groups acting 2-arc transitively on finite connected graphs such that there exists a minimal normal subgroup that is nonabelian and regular on vertices. A construction is given for such groups, together with the associated graphs, in terms of the following ingredients: a nonabelian simple group T, a permutation group P acting 2-transitively on a set , and a map F : Tsuch that x = x ^–1 for all x F() and such that Tis generated by F(). Conversely we show that all such groups and graphs arise in this way. Necessary and sufficient conditions are found for the construction to yield groups that are permutation equivalent in their action on the vertices of the associated graphs (which are consequently isomorphic). The different types of groups arising are discussed and various examples given.     

可迁格序置换群

给出了可迁置换群是单可迁的等价条件，证明了可数自由群及其直积可以嵌入到有理数集Ｑ的格序置换群Ａ（Ｑ）中。     

点可迁图的限制边连通度

对于度k( ≥ 2 )的点可迁连通图的限制边连通度λ′,已知k≤λ′≤ 2k- 2 ,且λ′的界可以达到 .在此基础上 ,对度为k的点可迁图G进一步给出了满足λ′(G) =k的两个充要条件 .接着 ,对任意的连通图G0 证明了λ′(K2 ×G0 ) =min{2δ (G0 ) ,2λ′(G0 ) ,v(G0 ) }.最后证明了对任意满足 0≤s≤k- 3的整数s,存在度为k的点可迁连通图G满足λ′(G)=k s当且仅当k为奇数或者s为偶数     

关于sumfromi=1ton(Ai+B)~k

利用生成函数的方法得到的一些性质和定理.     

Diffeomorphisms with C 1-stably average shadowing

Let M be a closed smooth manifold M, and let f : M → M be a diffeomorphism. In this paper, we consider a nontrivial transitive set Λ of f . We show that if f has the C1-stably average shadowing property on Λ, then Λ admits a dominated splitting.     

混合型模糊聚类分析方法及其应用

在动态聚类方法和模糊ISODATA方法的基础上,提出了混合型模糊聚类分析方法.该方法首先利用传统的传递闭包方法得到1个初始分类,并在此基础上提出初始分划矩阵,根据考虑权重因子的模糊ISODATA方法对相关数据进行迭代计算,从而对数据进行有效分类.以股票分类为例对该方法进行实证分析,分析结果表明,应用该方法可以对股票进行有效分类优选.     

三类有向三元系之间关系的一种猜想

一个Mendelsohn (Directed, 或Hybrid)三元系 MTS$(v, \lambda)$~(DTS$(v, \lambda)$,或HTS$(v,\lambda))$, 是由$v$元集$X$ 上的一些循环（可迁,或循环和可迁）三元组(简称区组)构成的集合${\cal B}$, 使得$X$上每个由不同元素组成的有序对都恰在 ${\cal B}$的$\lambda$个区组中出现.本文主要讨论了这三类有向三元系之间的一种关联关系,给出猜想：任意MTS$(v,\lambda)$的区组关联图$G(\     

奇Hamiltonian型滤过李超代数HO

本文应用象空间极小维数的方法研究了Cartan型模李超代数HO的非平凡可迁滤过(HO,R)的不变性.应用滤过的不变性得到模李超代数HO的某些内蕴性质,从而得到此类李超代数在同构意义下的分类.