Z-连通集系统及其范畴特征

本文引入了Z-连通集系统的概念,讨论了Z-连通连续偏序集的一系列性 质,证明了Z-连通连续偏序集范畴对偶等价于完全分配格范畴的一个满子范畴.     

S-定向完备偏序集范畴

给出定向完备偏序半群的定义,研究定向完备偏序半群在定向完备偏序集上的作用.探讨S-定向完备偏序集范畴的一些基本性质,并且证明以S-定向完备偏序集为对象,以S-Scott连续映射为态射的范畴是笛卡尔闭范畴.     

C_Z-偏序集

我们将强Z-连续偏序集推广到了CZ-偏序集,并讨论了CZ-偏序集和强Z-连续偏序集之间的关系。同时我们定义了CZ-偏序集上的CZ-连续映射,得到CZ-偏序集在该映射下的像集仍是CZ-偏序集。最后,我们讨论了CZ-偏序集上的基及其相关性质。     

FS-偏序集和连续L-偏序集

引入了FS-偏序集和连续L-偏序集概念,探讨了FS-偏序集和连续L-偏序集的性质.主要结果有(1)每一FS-偏序集都是有限上集生成的,因而是Scott紧的;(2)证明了FS-偏序集(连续L-偏序集)的定向完备化是FS-偏序集(连续L-偏序集);(3)一个偏序集是一个FS-Domain当且仅当它为Lawson紧的FS-偏序集;(4)FS-偏序集(连续L-偏序集)去掉部分极大元后还是FS-偏序集(连续L-偏序集).     

Lawson-Hoffmann对偶定理的推广

本文讨论了Z－连续偏序集的一系列性质，主要证明了Z－连续偏序集范畴对偶等价于完全分配格范畴的一个满子范畴．     

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

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

交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-连续格也可以不是交连续格.     

Z-连通代数偏序集及其范畴

对于Z-连通集系统,本文引入了Z-连通代数偏序集的概念,证明了Z-连通代数偏序集范畴对偶等价于强代数格范畴的一个满子范畴.     

L-连续偏序集的M性质与有限分离性

讨论了L-连续偏序集的M性质与有限分离性质之间的关系,主要结果: (1)若P为L-连续偏序集,则P是有限卜集生成,而且满足M性质当且仅当它的定向完备化为FS-domain(有限分离的domain);(2)若P为相容L-domain,则P是有限上集生成,而且满足M性质当且仅当它为相容FS-domain.     

强Raney偏序集

引入强Raney偏序集的概念,讨论了强Raney偏序集的一些性质,证明了强Raney偏序集为超代数偏序集,定向完备的偏序集为强Raney偏序集当且仅当它既是Raney偏序集也是A-偏序集.     

连续偏序集及其Smyth幂的几个等权定理

推广连续D om a in的权的概念到连续偏序集上,探讨连续偏序集的权、相应内蕴拓扑的权、定向完备化的权以及Sm yth幂D om a in的权间的关系。得到了几个等权定理:(1)连续偏序集的权与其上Scott拓扑、L aw son拓扑的权相等;(2)连续偏序集的权与其定向完备化的权相等;(3)无穷连续D om a in的权与其Sm yth幂D om a in的权相等;(4)有限D om a in的权小于或等于它的Sm yth幂D om a in的权。     

A category of quantum posets

We investigate a category of quantum posets that generalizes the category of posets and monotone functions. Up to equivalence, its objects are hereditarily atomic von Neumann algebras equipped with quantum partial orders in Weaver’s sense. We show that this category is complete, cocomplete and symmetric monoidal closed. As a consequence, any discrete quantum family of maps from a discrete quantum space to a partially ordered set is canonically equipped with a quantum preorder. In particular, the quantum power set of a quantum set is canonically a quantum poset. We show that each quantum poset embeds into its quantum power set in complete analogy with the classical case.     

代数的局部完备集范畴和FS-局部dcpo范畴的笛卡儿闭性

本文引入了代数的局部完备集,FS-局部dcpo,局部稳定映射等概念．主要结果是：以局部Scott连续映射为态射的代数的局部完备集范畴,以局部稳定映射为态射的代数的局部完备集范畴以及以局部Scott连续映射为态射的FS-局部dcpo范畴都是笛卡儿闭范畴．     

On poset Boolean algebras of scattered posets with finite width

We prove that the poset algebra of every scattered poset with finite width is embeddable in the poset algebra of a well ordered poset.Mathematics Subject Classification (2000):Primary 03G05, 06A06, 06A11; Secondary 08A05, 54G12     

Retractions onto series-parallel posets

The poset retraction problem for a poset P is whether a given poset Q containing P as a subposet admits a retraction onto P, that is, whether there is a homomorphism from Q onto P which fixes every element of P. We study this problem for finite series-parallel posets P. We present equivalent combinatorial, algebraic, and topological charaterisations of posets for which the problem is tractable, and, for such a poset P, we describe posets admitting a retraction onto P.     

New Results on Global Rank Axioms of Poset Matroids

An excellent introduction to the topic of poset matroids is due to M. Barnabei, G. Nicoletti and L. Pezzoli. On the basis of their work, we have obtained the global rank axioms for poset matroids.In this paper, we study the special integral function f and obtain a new class of poset matroids from the old ones, and then we generalize this result according to the properties of f. Almost all of these results can be regarded as the application of global rank axioms for poset matroids. The main results in our paper have, indeed, investigated the restriction of the basis of the poset matroid, and we give them the corresponding geometric interpretation.     

Efficient algorithms on distributive lattices

We present several efficient algorithms on distributive lattices. They are based on a compact representation of the lattice, called the ideal tree. This allows us to exploit regularities in the structure of distributive lattices. The algorithms include a linear-time algorithm to reconstruct the covering graph of a distributive lattice from its ideal tree, a linear-time incremental algorithm for building the ideal lattice of a poset and a new incremental algorithm for listing the ideals of a poset in a combinatorial Gray code manner (in an code.)     

Global Rank Axioms for Poset Matroids

An excellent introduction to the topic of poset matroids is due to Barnabei, Nicoletti and Pezzoli. In this paper, we investigate the rank axioms for poset matroids; thereby we can characterize poset matroids in a “global” version and a “pseudo-global” version. Some corresponding properties of combinatorial schemes are also obtained.     

Fuzzy格YX的特征

从两个方面对 Fuzzy格 YX 进行研究。通过讨论有限偏序集 X与 Fuzzy格 2 X 的关系 ,得到当 X为软偏序集时 ,2 X 必为 Fuzzy格 ;通过引入 E-非空概念 ,得到关于 Fuzzy格 YX 的重要定理。