不确定型AHP中单一准则下增加一组元素的保序性条件

本对区间数集定义了两种合理的偏序关系，给出了不确定型AHP中单一准则下增加一组元素弱保序的一个充分条件和强保序的一个充要条件。     

一类Domain范畴及其笛卡儿闭子范畴

本文给出一类新的 Ｄｏｍａｉｎ范畴 ＡｌｇＤ■（即以代数 Ｄｏｍａｉｎ为对象,保逼近序的Ｓｃｏｔｔ连续函数为态射的范畴）及其满子范畴ＡｌｇＤ■（即以有底（最小元）的代数Ｄｏｍａｉｎ为对象,保逼近序的Ｓｃｏｔｔ连续函数为态射的范畴）,并且讨论它们的极大的笛卡儿闭的满子范畴．     

模糊互补判断矩阵的一致性检验及修正

利用模糊互补判断矩阵进行决策时,指出既要保持元素间两两比较序的传递性又要保持整体偏差的可接受性,定义了严格及弱序传递、满意一致性矩阵等概念;提出一种新的修正算法并证明了其收敛性;最后给出一算例.     

排列、组合和二项式定理

分类计数原理和分步计数原理是排列组合的核心内容，它既是推导排列数、组合数公式的基础．也是解决排列组合问题的重要方法．分类是把复杂的问题分解成互相排斥的几类，然后逐类解决，分步是把解决问题的方法分解成几个相互联系且相互独立的步骤，较复杂的排列组合问题的解决常先分类再分步．解决带有附加条件的排列组合问题的方法主要有：（1）特殊元素分析法：优先安排特殊元素，再安排其它元素；（2）特殊位置分析法：优先安排特殊位置，再安排其它位置；（3）去杂法：先不考虑附加条件，计算出排列或组合数，再减去不符合要求的排列数或组合数；（4）插空法：对于要求某些元素不相邻的问题，可以先排好没有限制条件的元素，然后将要求不相邻的元素插入到排好的元素所产生的空档之中；（5）捆绑法：对于要求某些元素必须排在一起的问题，可以将要求相邻的元素合并为一个大元素，再与其它元素一起作排列，同时要注意合并元素内部也要作排列；（6）先分组后分配即先选后排；（7）隔板法；（8）去序法；（9）列举法，特别要注意利用“树形图”不漏不重地列举；（10）集合法．     

无限集上严格保序变换半群的正则元及格林关系

设X是一个全序集,SOx是X上的严格保序变换半群.考虑X是一个全序无限集的情形.讨论了SOx中的正则元和SOx上的格林关系.证明了SOx中的元素α是正则的当且仅当α是双射.还证明了SOx的所有正则元形成SOx的一个极大子群.另外,给出了SOx上的格林关系L,R,D和H的刻划.SOx上格林关系的刻画对SOx的研究起重要作...     

DEA中有效值的一种求法与保序的条件

对DEA中决策单元的有效值,本文给出了求它的二个定理,并给出了在导入新的决策单元后其保序的充分条件,最后举例说明这条件不成立时的结果.     

求n阶实方阵A的全部模最大的特征值及其相应特征向量的幂法

本给出并论证了,当ｎ阶实方阵Ａ具有ｉ（１≤ｉ≤ｎ）个（即任意多个）模最大的特征值时,用幂法求出这些模最大的特征值及其相应特征向量的方法。该方法是对幂法理论的进一步完善。     

多维正态分布均值在序约束下的假设检验

在序限制下的统计推断是统计分析中的一个重要领域，保序回归理论在这个领域中起着关键性的作用。多维保序回归是一维保序回归的推广，本文给出了k=2,p=2时多维保序回归的求解方法。令Xij,j=1,2…，n是来自总体为二维正态分布N（μi，Λ)的样本，这是μi是未知的，Λ是已知的，i=1,2。令μ=（μ1,μ2)，-={（μ1,μ2)|μ1,μ∈R^2,}-0={(μ1,μ2)|μ1≤μ2,μ1，μ2∈R^2}。μ1≤μ2表示μ2-μ1的每一个分量为非负。本文也讨论了假设检验问题H0:μ∈-0,H1:μ∈-0=---0(H0是零假设）。     

一类用不等式表示的强律

通过构造适当的辅助非负半鞅可给出关于sm（i,j,l）的一个对任意整值随机变量序列普遍成立的用不等式表示的一个强大数定律．其中sm（i,j,l）表示三元序组（X0,X1,X2）,（X1,x2,X3）,…．（xn-2,xn-1,,xn）中序组（i,j．l）出现的次数．而{xn,n≥0）是一随机变量序列．     

Fuzzy边界与序同态的特征性质

本文首先给出Fuzzy拓扑空间中元的边界定义和它的一般性质,而后讨论Fuzzy拓扑空间之间保边界、保内部、保闭包等序同态的若干特征性质,及其与开、闭序同态,连续序同态,同胚序同态之间的关系。     

模糊互补判断矩阵的一个通用排序公式及其保序性研究

基于模糊互补判断矩阵的一致性转化,利用行和归一化方法,得到了模糊互补判断矩阵的一个排序公式,指出目前基于模糊加性一致的排序公式大多都是所提方法的特例,并给出了在增加一个或一组新元素时的保序性条件.     

特征为2的有限域上对称矩阵方程解的计数公式及q超几何级数表达

设Fq是有q＝2t个元的有限域.本文利用Fq上奇异辛几何和奇异伪辛几何理论,给出当A,C是Fq上对称矩阵时,Fq上适合XAXT＝C的解存在的充要条件以及秩k的解X和解X的个数的明显公式,并且用q超几何级数简化表达解数公式．     

Splitting Mixed Groups of Finite Torsion-Free Rank

Abstract

First, we give a necessary and sufficient condition for torsion-free finite rank subgroups of arbitrary abelian groups to be purifiable. An abelian group G is said to be a strongly ADE decomposable group if there exists a purifiable T(G)-high subgroup of G. We use a previous result to characterize ADE decomposable groups of finite torsion-free rank. Finally, in an extreme case of strongly ADE decomposable groups, we give a necessary and sufficient condition for abelian groups of finite torsion-free rank to be splitting.     

Normalized Matching in Direct Products of Partial Orders

In this paper we investigate the question: When does the direct product of partial orders each satisfying the normalized matching condition also satisfy it? A proof of Harper's result that a sufficient condition for this is that factor partial orders have rank populations that are multiplicatively convex, is presented. A general necessary and sufficient condition is described, and conditions which occur when one factor is a chain are obtained. In particular we show that under these circumstances it is necessary that the product order have multiplicatively convex population rank.     

A Sufficient condition for strict total positivity of a matrix

We establish a sufficient condition for strict total positivity of a matrix In particular, we show that if the (positive) elements of a square matrix grow sufficiently fast as their distance from the diagonal of the matrix increases, then the matrix is strictly totally positive.     

Determinimg abelian p-groups from their n-Socles

A necessary condition is given for a very wide separable p-group to be derermined by its n-socle (the set of elements of order at most p ⁿ). A group G is very wide if it has a direct summand of final rank ‖G‖ which itself is a direct sum of cyclic groups. In the case, n=1 (as Shelat has shown)this condition is sufficient but for n>1 examples are given to show that this condition is not sufficient.     

Analogues of IBN and related properties for modules

We generalise the familiar notions of invariant basis number, rank condition, stable finiteness and strong rank condition from rings to modules. We study the inter relationship between these properties, identify various classes of modules possessing these properties and investigate the effect of many standard module theoretic operations on each one of these properties. We also tackle the important problem of preservation or non-preservation of these properties when we pass respectively to the module of polynomials, power series or inverse polynomials.     

Non-cancellation for certain classes of groups

For a certain class of groups, which are semidirect products arising from an action of a finite rank free abelian group on another group, we study cancellation of the infinite cyclic group in isomorphic direct products. As an application we obtain a sufficient condition for triviality of the genus of certain nilpotent groups.     

Inverse Near Permutation Semigroups

A transformation semigroup over a set X with N elements is said to be a near permutation semigroup if it is generated by a group G of permutations on N elements and by a set H of transformations of rank N - 1. In this paper we give necessary and sufficient conditions for a near permutation semigroup S = ‹G,H›, where H is a group, to be inverse. Moreover, we obtain conditions which guarantee that its semilattice of idempotents is generated by the idempotents of S of rank greater than N - 2 or N - 3.