伪补分配格的同余理想与同余关系

L是完备的伪补分配格,I是L的同余理想,本文得到以下结果：⑴θ是L的以I为核的最大同余关系的条件。⑵L的以I为核的同余关系是唯一的充分必要条件。⑶L的同余理想与同余关系之间有一一对应关系的充分必要条件。     

幂等扩张的有界分配格

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

伪补分配格上的主同余关系

本文研究了伪补分配格Ｌ的＊－同余关系的基本性质。主要给出了：⑴主同余θ＊（ａ,ｂ）的一个具体刻划;⑵理想Ⅰ成为同余理想的一个充要条件的以Ⅰ为核心的最小＊－同余θ＊（Ｉ）;⑶Ｌ上的格同余θＬ（ａ,ｂ）成为＊－同余的干充要条件。其中的大部分结果必进或包含了已有的结论。     

分配格中同余关系的性质

分两种情况讨论了分配格与有限代数的同余关系格同构的问题,给出判断分配格的充分必要条件,证明了两个结论:有限分配格是Boole格和具有可数个元的分配格的同余关系格是Boole格.     

伪补分配格上理想成为同余理想的条件北大核心

介绍了伪补分配格的理想成为同余理想的若干条件和性质,给出了主理想成为同余理想所满足的条件和形式,并用改进的方法予以证明。     

幂格的同余关系

研究分配格的幂格的同余关系,给出幂格的同余关系格的一些重要性质,并得到幂格的一个同余类和同余关系格的两个交半格。     

K11-代数的主同余关系的可补性

研究K11-代数的主同余关系的可补性,给出K11-代数的主同余关系是可补的充要条件。     

半环的强分配格上的环同余

主要讨论了在一定条件下半环的强分配格S上的环同余ρ与半环族{Sα}α∈D上的环同余族{ρα}α∈D之间的关系.     

幂等扩张的分配格的同余可换性

本文研究了幂等扩张的有界分配格的同余可换性问题.利用幂等扩张的有界分配格的对偶理论,得到了同余可换的幂等扩张的有界分配格的一个充分必要条件,推广了Davey和Priestley关于有界分配格的一些结果.     

双重Stone代数的主同余关系

给出了双重Stone代数的主同余关系θ(a,b)(a≤b)的等式刻划以及其它的一些性质,由此得到了主同余关系θ(a,b)(a≤b)存在Boo le-补的若干充分条件.     

序半群的一类正则同余

设S是有向序半群,本文给出了S上的一类正则同余,称为强序同余的定义及性质.证明了S的强序同余是强正则同余,但反之不成立.同时证明了强序同余格SOC(S)是S的同余格C(S)关于通常集合的交和传递积的V-完备的分配子格.     

分配格中模糊理想诱导的模糊幂格

在模糊幂格讨论基础上,给出了由分配格中模糊理想诱导的两种模糊幂格.     

集对Fuzzy格及其在格表示论中的应用

用幂集格构造了集对 Ｆｕｚｚｙ 格（这与用整数对构造有理数集有相似之处）,并用它证明了完整的软代数表示定理,即定义了到自身的映射且有最大元和最小元的格为软代数的充要条件是它与某个集对 Ｆｕｚｚｙ 格的子格同构．这样,与分配格在幂集 Ｂｏｏｌｅ 格中表示相对应,软代数在集对 Ｆｕｚｚｙ 格中有表示,在理论上是很完美的     

纯正半群上的强同余及其格

给出了纯正半群S的强同余格上同余T的一些判别性质,证明了S上所有基础强同余所构成的集合FCP（S）是CP（S）的完备子格,最后讨论了由纯正半群的正规子半群决定的交完备子格的结构及由“求核”运算确定的（交完备格）同余K的若干性质,还顺带讨论了群同余格.     

On the restricted cores and the bounded core of games on distributive lattices

A game with precedence constraints is a TU game with restricted cooperation, where the set of feasible coalitions is a distributive lattice, hence generated by a partial order on the set of players. Its core may be unbounded, and the bounded core, which is the union of all bounded faces of the core, proves to be a useful solution concept in the framework of games with precedence constraints. Replacing the inequalities that define the core by equations for a collection of coalitions results in a face of the core. A collection of coalitions is called normal if its resulting face is bounded. The bounded core is the union of all faces corresponding to minimal normal collections. We show that two faces corresponding to distinct normal collections may be distinct. Moreover, we prove that for superadditive games and convex games only intersecting and nested minimal collection, respectively, are necessary. Finally, it is shown that the faces corresponding to pairwise distinct nested normal collections may be pairwise distinct, and we provide a means to generate all such collections.     

Some properties of a generalized Hamy symmetric function and its applications

This paper is concerned with the generalized Hamy symmetric function

     

Generalized dressing method for the extended two-dimensional Toda lattice hierarchy and its reductions

In this paper, we solve the extended two-dimensional Toda lattice hierarchy (ex2DTLH) by the generalized dressing method developed in Liu-Lin-Jin-Zeng (2009). General Casoratian determinant solutions for this hierarchy are obtained. In particular, explicit solutions of soliton-type are formulated by using the τ-function in the form of exponential functions. The periodic reduction and one-dimensional reduction of ex2DTLH are studied by finding the constraints. Many reduced systems are shown, including the pe...     

The research and progress of the enumeration of lattice paths

The enumeration of lattice paths is an important counting model in enumerative combinatorics. Because it can provide powerful methods and technical support in the study of discrete structural objects in different disciplines, it has attracted much attention and is a hot research field. In this paper, we summarize two kinds of the lattice path counting models that are single lattice paths and family of nonintersecting lattice paths and their applications in terms of the change of dimensions, steps, constrained conditions, the positions of starting and end points, and so on. (1) The progress of classical lattice path such as Dyck lattice is introduced. (2) A method to study the enumeration of lattice paths problem by generating function is introduced. (3) Some methods of studying the enumeration of lattice paths problem by matrix are introduced. (4) The family of lattice paths problem and some counting methods are introduced. (5) Some applications of family of lattice paths in symmetric function theory are introduced, and a related open problem is proposed.