完备格上并既约元的性质

首先给出一个连续并既约元的概念,然后在完备格上对并既约元的性质进行了探讨.     

模糊弱S-置换子群

给出了模糊弱S-置换子群的概念,并利用既约集合套给出了模糊弱S-置换子群的等价定义。同时研究了模糊弱S-置换子群的一些性质,并讨论了相应的同态性质。     

连续并既约元及其在刻画Fuzzy关系方程解集中的应用

本文首先引入连续并既约元(是并既约元但不是完全并既约元的元)的概念,并讨论了它的性质,然后应用连续并既约元的性质去刻画完备Brouwer格上无限Fuzzy关系方程A☉X=b的解集(其中A=(aj)j∈J和b已知,b为连续并既约元,X= (xj)j∈JT未知,“☉”表示“sup-inf”,J为无限集):给出了方程存在可达解与不可达解的充要条件及可达解与不可达解的一些性质,进一步刻画了方程的解集．     

偏序集上的滤子极大理想

在偏序集上引入并考察了滤子极大理想的概念,证明了相应的存在性定理。引入并考察了伪极大元和伪既约元的概念,利用图表的形式对连续格中各种类型的既约元和素元之间的关系进行了归纳总结,完善了文献《Continuous Lattices and Domains》(作者:G.Gierz,et al)中的一个图表的相关内容,填补了在分配的连续格情形该图表的一个未知内容,部分地回答了该文献中的一个问题。     

分子格的既约度,分解度与分子格乘积的既约性

为探讨分子格的乘积的既约性和乘积的既约分解,文献[1]提出了分子格的既约度和分解度的概念,本文是[1]的继续,进一步给出了分子格的既约度与分解度的一些性质,证明了关于分子格乘积的全体主子格之集的基数的一个定理,以及得出了一族分子格的乘积是既约分子格的一个充要条件,此外,本文还证明了分子格范畴中乘积对上积的完全分配性是自然同构,改正了[1]中对这一结论的证明。     

不可约矩阵的弱指数

作者与Ｒ．Ａ．Ｂｒｕａｌｄｉ教授提出了不可约矩阵弱指数的概念（见［Ｂｒｕｌｉｕ２］）．本文给出了弱指数（弱本原指数，弱完全不可分解指数，弱Ｈａｌｌ指数）的上确界以及它们的指数集．     

条件交半格中的相对极大滤子

引入偏序集的相对极大滤子的概念,证明在任意条件交半格中一个滤子是相对极大滤子当且仅当它是滤子格的完全交不可约元.一个格是分配的当且仅当每一个相对极大滤子都是素滤子.随后研究了Heyting代数中相对极大滤子的刻画,最后定义和研究了完全并既约生成格.     

分子格上伪补的构造

本文给出了分子格上伪补的构造定理，并证明了当一个非平凡分子格上有伪补，其既约因子上并不一定存在伪补，但其准既约因子上一定存在伪补，且任一分子格上的伪补都可表为其准既约因子上伪补的直积．     

完备主因子格上的不可约并既分解

讨论了完备主因子格的一些结构性质,得到了完备分配格有不可约并既分解及不可约完全并既分解和不可约连续并既分解的一些充要条件。     

半连续格上的一个注记

就文献[3]中的命题4．7提供了一种简单证法。此外，我们给出了在半连续格条件下伪素元的内部刻画。最后，我们定义了一种新的元素——弱素元，给出了伪素元，〈=-素元与弱素元等价的条件。     

Going down in (semi)lattices of finite moore families and convex geometries

In this paper we first study what changes occur in the posets of irreducible elements when one goes from an arbitrary Moore family (respectively, a convex geometry) to one of its lower covers in the lattice of all Moore families (respectively, in the semilattice of all convex geometries) defined on a finite set. Then we study the set of all convex geometries which have the same poset of join-irreducible elements. We show that this set—ordered by set inclusion—is a ranked join-semilattice and we characterize its cover relation. We prove that the lattice of all ideals of a given poset P is the only convex geometry having a poset of join-irreducible elements isomorphic to P if and only if the width of P is less than 3. Finally, we give an algorithm for computing all convex geometries having the same poset of join-irreducible elements.      

vspace{-1cm}$W(2,\boldsymbol{n})$和$H(2,\boldsymbol{n})$的$p$-特征标高度为$2$的不可约模的分类$^{}$

研究$p$-\!\!特征标高度等于$2$的$W(2,\boldsymbol{n})$和$H(2,\boldsymbol{n})$ 的不可约表示, 给出了当 $p$-\!\!特征标$\chi $的 高度等于$2$时, $L=X(2,\boldsymbol{n})$, $X=W,H$ 的不可约$L$-\!\!模 同构类代表元集合.     

Fuzzy函数并不可约元的再化简问题

文（１）将Ｆｕｚｚｙ逻辑函数化为并不约元的和式，本文讨论将这个和式进行再化简，主要证明了可删去项和字的充分必要条件，从而找到了反Ｆｕｚｚｙ逻辑函数化到最简而且是简便的方法。     

Generalized Irreducible Divisor Graphs

In 1988, Beck introduced the notion of a zero-divisor graph of a commutative rings with 1. There have been several generalizations in recent years. In particular, in 2007 Coykendall and Maney developed the irreducible divisor graph. Much work has been done on generalized factorization, especially τ-factorization. The goal of this paper is to synthesize the notions of τ-factorization and irreducible divisor graphs in domains. We will define a τ-irreducible divisor graph for nonzero non unit elements of a domain. We show that, by studying τ-irreducible divisor graphs, we find equivalent characterizations of several finite τ-factorization properties.     

幂等扩张的有界分配格

考察了扩张的有界分配格类eD即带有自同态k的有界分配格,研究了具有幂等性的eD-代数的表示、同余关系以及次直不可约性,证明了这样的代数类有5个互不同构的次直不可约的幂等扩张的有界分配格。     

A Note on the Composite of Two Irreducible Morphisms

In this note, we show that a composite of two irreducible morphisms between indecomposable modules cannot lie in ?³\?⁵.     

Intervals in Lattices of κ-Meet-Closed Subsets

We study abstract properties of intervals in the complete lattice of all κ-meet-closed subsets (κ-subsemilattices) of a κ-(meet-)semilattice S, where κ is an arbitrary cardinal number. Any interval of that kind is an extremally detachable closure system (that is, for each closed set A and each point x outside A, deleting x from the closure of A∪{x} leaves a closed set). Such closure systems have many pleasant geometric and lattice-theoretical properties; for example, they are always weakly atomic, lower locally Boolean and lower semimodular, and each member has a decomposition into completely join-irreducible elements. For intervals of κ-subsemilattices, we describe the covering relation, the coatoms, the ∨-irreducible and the ∨-prime elements in terms of the underlying κ-semilattices. Although such intervals may fail to be lower continuous, they are strongly coatomic if and only if every element has an irredundant (and even a least) join-decomposition. We also characterize those intervals which are Boolean, distributive (equivalently: modular), or semimodular. Mathematics Subject Classifications (2000) Primary: 06A12; Secondary: 06B05, 06A23, 52A01.