关于L—fuzzy拓扑空间的闭包算子与乘积算子的可交换性

本文利用Fuzzy格的代数性质,从L-fuzzy拓扑的层次结,构入手,定义了闭包保层空间,藉助于它给出了满层L-fuzzy拓扑空间的闭包算子与乘积算子可交换的等价条件,并证明了:若乘积L-fuzzy拓扑空间的每个因子空间都是诱导的,则闭包算子与乘积算子是可交换的,从而较好地解决了[2]中所提出的问题。     

基于M-模糊化P-闭集族刻画M-模糊化拟阵

在已有M-模糊化拟阵的研究基础上,引入了M-模糊化秩函数及M-模糊化P-闭包算子的定义,研究了M-模糊化P-闭包算子的性质,并定义了M-模糊化P-闭集族及研究了它的基本性质,同时借助于M-模糊化拟阵的层拟阵结构,得到M-模糊化拟阵可由M-模糊化P-闭集族等价刻画这一结论.     

层次闭包空间的范畴性质(Ⅰ)

构造了层次闭包算子空间范畴SCPS中的初始结构,证明了该范畴是拓扑的,定义并研究了层次闭包空间的子空间,乘积空间和余积空间.     

覆盖空间及粗糙集与拓扑的统一

引入覆盖空间,定义了其邻域、内部、闭包、测度等概念,研究了它们的性质.得出了粗糙集近似空间和拓扑空间都是具体覆盖空间的重要结论,从而用覆盖空间统一了粗糙集和拓扑.利用覆盖空间,得到了粗糙集和拓扑中更深刻的性质,从算子论和集合论的角度丰富和深化了粗糙集与拓扑的内容.     

模糊化(拓扑)导空间

界定了模糊化(拓扑)导算子满足的公理,并且给出了若干模糊化(拓扑)导算子的刻画;同时建立了模糊化(拓扑)导算子和模糊化(拓扑)闭包算子之间的关系,进一步引入了模糊化拓扑导空间范畴I-GDS,并证得范畴I-GCS和I-GDS同构.     

M-模糊化拟阵的差导算子北大核心

引入M-模糊化差导算子的新概念,给出它的一些等价刻画,探讨M-模糊化拟阵、M-模糊化差导算子以及M-模糊化闭包算子之间的关系。     

关于模糊拟阵的独立模糊集生成问题的一些结果

本文首先定义"生成模糊集族",利用这个概念构建了闭模糊拟阵的独立模糊集生成定理,并利用这个定理找到了模糊拟阵是闭模糊拟阵的一个充要条件;然后,利用"基子集套"概念讨论了模糊拟阵闭包的一个等价描述,通过这个等价描述详细探讨了模糊拟阵与其闭包的关系;最后,利用这些关系,得到了普通模糊拟阵的独立模糊集次生成定理。     

Fuzzifying闭包系统的研究

在Fuzzifying(模糊化)数学的框架下,建立了Fuzzifying闭包系统和Birkhoff型Fuzzifying闭包算子的概念; 引入了Fuzzifying闭包空间范畴和Fuzzifying闭包系统空间范畴,并从范畴论的角度证明Birkhoff型Fuzzifying闭包算子与Fuzzifying闭包系统是协调的.最后文中还得到Fuzzifying闭包空间范畴和Fuzzifying闭包系统空间范畴可以嵌入到Birkhoff型L-闭包空间范畴这一重要结果.     

光滑l-Fuzzy拓扑空间的闭包算子

本文的目的是在光滑L—fuzzy拓扑空间上给出闭包算子的概念，利用集合套的方法给出它的一些等价刻画，并讨论它的性质及其应用．     

由上近似数诱导的拟阵及其特征

拟阵理论与粗糙集理论之间有很多相似之处,近年来,探讨这二者之间的联系成为一个研究热点.首先利用基于等价关系的上近似数诱导了一系列拟阵结构,然后刻画了这类拟阵的独立集、基集、秩函数以及闭包等,讨论了与其它拟阵之间的一些联系.     

Extreme values of the sum of squares of degrees of bipartite graphs

In this paper we determine the minimum and maximum values of the sum of squares of degrees of bipartite graphs with a given number of vertices and edges.     

Number of connected components of groups of real points of adjoint groups

We present a unified approach to compute the number of connected components in the group of real points of adjoint almost simple real algebraic groups.     

Estimation of the number of components of finite mixtures of multivariate distributions

An estimator of the number of components of a finite mixture ofk-dimensional distributions is given on the basis of a one-dimensional independent random sample obtained by a transformation of ak-dimensional independent random sample. A consistency of the estimator is shown. Some simulation results are given in a case of finite mixtures of two-dimensional normal distributions.     

Eigenvector p-Bases of Rings of Constants of Derivations

Let A be a UFD of characteristic p > 0, let 𝒵 be a set of some eigenvectors of a derivation of A. We prove, under some additional assumptions, a necessary and sufficient condition for 𝒵 to be a p-basis of the minimal ring of constants containing 𝒵. The main preparatory result is the unique decomposition theorem with respect to a factor from a given subalgebra containing A^p.     

Galois Structure of K-Groups of Rings of Integers

N/Kbe a Galois extension of number fields with finite Galois group G.We describe a new approach for constructing invariants of the G-module structure of the K groups of the ring of integers of N in the Grothendieck group of finitely generated projective Z[G]modules. In various cases we can relate these classes, and their function field counterparts, to the root number class of Fröhlich and Cassou-Noguès.     

Radius of convexity of certain classes of analytic functions

We consider the classes of analytic functions introduced recently by K.I. Noor which are defined by conditions joining ideas of close-to-convex and of bounded boundary rotation functions. We investigate coefficients estimates and radii of convexity.     

Enumeration of perfect matchings of a type of Cartesian products of graphs

Let G be a graph and let Pm(G) denote the number of perfect matchings of G.We denote the path with m vertices by P_m and the Cartesian product of graphs G and H by G×H. In this paper, as the continuance of our paper [W. Yan, F. Zhang, Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians, Adv. Appl. Math. 32 (2004) 175-188], we enumerate perfect matchings in a type of Cartesian products of graphs by the Pfaffian method, which was discovered by Kasteleyn. Here are some of our results:1. Let T be a tree and let C_n denote the cycle with n vertices. Then Pm(C₄×T)=∏(2+α²), where the product ranges over all eigenvalues α of T. Moreover, we prove that Pm(C₄×T) is always a square or double a square.2. Let T be a tree. Then Pm(P₄×T)=∏(1+3α²+α⁴), where the product ranges over all non-negative eigenvalues α of T.3. Let T be a tree with a perfect matching. Then Pm(P₃×T)=∏(2+α²), where the product ranges over all positive eigenvalues α of T. Moreover, we prove that Pm(C₄×T)=[Pm(P₃×T)]².     

有资格限制的指派问题的求解方法

在实际的指派工作中，常会遇到某个人有没有资格去承担某项工作的问题，因此，本建立了有资格限制的指派问题的数学模型。在此数学模型中，将效益矩阵转化为判定矩阵，由此给出了判定此种指派问题是否有解的方法；在有解的情况下，进一步将效益矩阵转化为求解矩阵，从而将有资格限制的指派问题化为传统的指派问题来求解。最后给出了一个数值例子来说明这样的处理方法是有效的。