连续树映射的ω极限集与非游荡集

本文研究树上连续自映射f的ω极限集∧,非游荡集Ω的若干拓扑结构,主要证明了不在周期点集闭包中的ω极限点都有无限轨迹;Ω-     

关于有效点集的闭性和连通性

本文的主要结果是，假设Ａ是局部凸空间里的紧的Ｆ一集，则Ａ的有效点集Ｅ（Ａ｜Ｃ）是闭集。需要提及的是，此结果中关于Ａ并没有作任何凸性的假设，如果对它再附加某种凸性假设条件时，则本文进一步证明了有效点集Ｅ（Ａ｜Ｃ）不但是闭集，而且还是连通集。     

连续树映射的ω极限集与非游荡集

本文研究树上连续自映射ｆ的ω极限集Λ,非游荡集Ω的若干拓扑结构,主要证明了：不在周期点集闭包中的ω极限点都有无限轨迹;Ω－Ｐ,Ω－Γ为可数集,Λ－Γ,Ｐ－Γ或为空集或可数无限,其中Γ为ｆ的γ极限集．     

关于''抽象的极小极大定理''的注记

本文指出林壮鹏2000年发表的一个抽象的极大极小定理一文中主要结果的证明需要修正,然后改进了该文的结果,同时给出了一个简单的证明。     

集值映射多目标规划问题的解集的连通性

本文研究了无限维空间里集值映射的多目标规划问题。主要结果是：当目标函数为类凸的集值映射时，其目标空间里的有效点集是连通的；若目标函数为Ｃ－凸的集值映射时，其有效解集也连通。     

关于（mod K）可度量空间

本文的主要结果是证明在Ｔ１空间类中下列条件相互等价：（１）空间具有σ局部有限（ｍｏｄ Ｋ）基。（２）空间具有σ遗传闭包保持（ｍｏｄ Ｋ）基。（３）空间具有σ紧有限（ｍｏｄ Ｋ）基。     

z-代数偏序集的范畴特征

讨论z-代数偏序集一些性质,主要证明z-代数偏序集范畴对偶等价于强代数格范畴的一个满子范畴.     

集值映象的某些重合定理

Browder[1]已得到了Schauder不动点定理的加强形式.许多作者从不同方向推广了Browder的结果.最近H.M.Ko;K.K.Tan[2]在放松紧性条件下得到了Browder定理的改进,K.K.Tan[3]将Browder定理推广到了集值映象对的重合定理,在本文中我们得到了集值映象对的某些重合定理,它们分别改进和推广了[1,2,3]中主要结果.     

可测空间与Pawlak代数

用可测集定义的上（下）方逼近算子apr(apr)讨论可测空间与Pawlak代数之间的关系,指出可测集即是明确集,可测空间（U,A）可扩张为（U,A）,使其满足任意并（交）的封闭性,从而将文献[1]的主要定理推广到一般情况。     

交C-连续偏序集

利用偏序集上的半拓扑结构,引入了交C-连续偏序集概念,探讨了交C-连续偏序集的性质、刻画及与C-连续偏序集、拟C-连续偏序集等之间的关系.主要结果有:(1)交C-连续的格一定是分配格;(2)有界完备偏序集(简记为bc-poset)L是交C-连续的当且仅当对任意x∈L及非空Scott闭集S,当∨S存在时有x∧∨S=∨{x∧s:s∈S};(3)完备格是完备Heyting代数当且仅当它是交连续且交C-连续的;(4)有界完备偏序集是C-连续的当且仅当它是交C-连续且拟C-连续的;(5)获得了反例说明分配的完备格可以不是交C-连续格,交C-连续格也可以不是交连续格.     

Locating and paired-dominating sets in graphs

In this paper, we continue the study of paired-domination in graphs introduced by Haynes and Slater [T.W. Haynes, P.J. Slater, Paired-domination in graphs, Networks 32 (1998), 199–206]. A paired-dominating set of a graph G with no isolated vertex is a dominating set S of vertices whose induced subgraph has a perfect matching. We consider paired-dominating sets which are also locating sets, that is distinct vertices of G are dominated by distinct subsets of the paired-dominating set. We consider three variations of sets which are paired-dominating and locating sets and investigate their properties.     

Difference Sets and Recursion Theory

There is a recursive set of natural numbers which is the difference set of some recursively enumerable set but which is not the difference set of any recursive set.     

An extension of building sets and relative difference sets

Building sets are a successful tool for constructing semi‐regular divisible difference sets and, in particular, semi‐regular relative difference sets. In this paper, we present an extension theorem for building sets under simple conditions. Some of the semi‐regular relative difference sets obtained using the extension theorem are new in the sense that their ambient groups have smaller ranks than previously known. © 2000 John Wiley & Sons, Inc. J Combin Designs 8: 50–57, 2000     

有限域上多项式集的简单分解

研究如何将任意有限域上的多项式集分解为有限多个简单列.为了解决这一问题,首先研究简单列和根理想之间的关系,然后基于已有的正则分解算法和有限域上理想的根的两种计算方法设计一个有限域上多项式集的简单分解算法.计算试验表明,文章给出的算法是有效的.     

Some formal relationships among soft sets,fuzzy sets,and their extensions

We prove that every hesitant fuzzy set on a set E can be considered either a soft set over the universe $[0,1]$ or a soft set over the universe E. Concerning converse relationships, for denumerable universes we prove that any soft set can be considered even a fuzzy set. Relatedly, we demonstrate that every hesitant fuzzy soft set can be identified with a soft set, thus a formal coincidence of both notions is brought to light. Coupled with known relationships, our results prove that interval type-2 fuzzy sets and interval-valued fuzzy sets can be considered as soft sets over the universe $[0,1]$. Altogether we contribute to a more complete understanding of the relationships among various theories that capture vagueness and imprecision.     

未确知集

分析了模糊集与R ough集两种不确定性集合的异同,指出模糊集中存在的不足和缺陷,在此基础上定义一种新的不确定性集合称作未确知集.在未确知集中模糊集的不足与缺陷得到弥补与修正,并且未确知集具有普通集合的含义.通过分析未确知集与模糊集的相同点及本质区别来论证未确知集存在与值得研究的价值.最后例举了常用的未确知隶属函数的构造方法.     

Solution of the Cameron-Erdös problem for groups of prime order

A subset A of a group G is sum-free if a + b does not belong to A for any a, b ∈ A. Asymptotics of the number of sum-free sets in groups of prime order are proved.     

Almost semirecursive sets

LetA be a subset of , and leta∉A. The setA is said to be almost semirecursive, if there is a two-place general recursive functionf such thatf(x, y)ε{x, y, a}∧({x, y}⊆A⇌f(x, y)εA) for all . Among other facts, it is proved that ifA and are almost semirecursive sets, thenA is a semirecursive set, and that there exists a wsr^*-set that is neither a wsr-nor an almost semirecursive set. Translated fromMatematicheskie Zametki, Vol. 66, No. 2, pp. 188–193, August, 1999.     

A CLASS OF MODELS FOR SKALA'S SET THEORY

For each ordinal α it is given a model for Skala's set theory using the well-known cumulative type hierarchy.