强Raney偏序集

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

强代数偏序集

引入了一种新的强代数偏序集的概念,证明了偏序集P为强代数的当且仅当其正规完备化δ(P)为强代数格,给出了强代数偏序集的内蕴式刻画。     

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

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

S-定向完备偏序集范畴

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

偏序集的φ-(交)连续性及其主理想刻画

证明φ-完备偏序集是（强）P连续的当且仅当该偏序集的任一主理想是（强）φ-连续的。在φ-完备偏序集中利用φ-S集族生成f-Scott拓扑，并由此引入φ-交连续偏序集概念。证明φ-完备偏序集是P交连续的当且仅当该偏序集的任一主理想是φ-交连续的。     

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

偏序集上一致连续性的等价刻画与性质

将一致小于关系移植到一般偏序集上,同时引入了上界小于关系,定义了偏序集的一致连续性和上界连续性.给出了一致连续偏序集的等价刻画,探讨了一致连续偏序集所具有的性质.主要结果有:(1)证明了偏序集上的一致连续性,上界连续性与s-超连续性均等价;(2)在交半格条件下,偏序集的一致连续性等价于它的每一主理想一致连续;(3)在并半格条件下,偏序集的一致连续性蕴含连续性,反之不成立;(4)一致完备的一致连续偏序集均是连续bc-dcpo,且每个主理想均为完全分配格;(5)在一致完备的条件下,一致连续性对主滤子,对闭区间,对Scott S-集以及对一致连续投射像均是可遗传的.文中也构造了若干实用的反例.     

模糊偏序集上理想完备的幂等性

主要讨论模糊偏序集上理想完备性的本质.并得到以下结论:模糊偏序集的理想完备是幂等的当且仅当理想完备上的广义Scott拓扑与Alexandroff拓扑是一致的.     

关于连续偏序集的一个刻画定理(英文)

本文给出了连续偏序集的一个刻画定理及相应的代数偏序集刻画定理.进一步得出连续偏序集P关于其Scott拓扑是局部紧的,而且OFilt(P)是一个domain.这推广了关于dcpo的对应结果.     

一致极小集及其对一致连续偏序集的应用

对于一致极小集,讨论了它的一些性质及与一致连续偏序集的关系,给出了一致连续偏序集中保一致极小集映射的一些等价刻划。最后,得到了关于保一致极小集映射的扩张定理。     

Canonical extensions of posets

We study a construction that produces a variety of completions of a given poset. The denseness and compactness properties of the completions obtained in this way are investigated. Next we focus our attention on three specific completions of a given poset that can be obtained through this construction—two of which have been called ‘the canonical extension’ of the poset in the literature. We investigate extensions of maps to these three completions. Although the extensions of unary operators need not be operators on the completions, we show that the extensions of unary residuated maps are residuated. We also investigate extensions of n-ary maps. In particular, we have a closer look at order-preserving n-ary maps and binary residuated maps.     

Quasicontinuity of Posets via Scott Topology and Sobrification

In this paper, posets which may not be dcpos are considered. In terms of the Scott topology on posets, the new concept of quasicontinuous posets is introduced. Some properties and characterizations of quasicontinuous posets are examined. The main results are: (1) a poset is quasicontinuous iff the lattice of all Scott open sets is a hypercontinuous lattice; (2) the directed completions of quasicontinuous posets are quasicontinuous domains; (3) A poset is continuous iff it is quasicontinuous and meet continuous, generalizing the relevant result for dcpos. Supported by the NSF of China (10371106, 10410638) and by the Fund (S0667-082) from Nanjing University of Aeronautics and Astronautics.     

B-posets, FS-posets and Relevant Categories

In this paper the new concept of B-posets is introduced. Some properties of B-posets and FS-posets are examined. Main results are: (1) Posets obtained from B-posets (FS-posets) by eliminating a proper upper subset, adding two or more finitely many incomparable maximal elements, taking vertical sums w.r.t. a maximal element are also B-posets (FS-posets); (2) A poset is a(n) B-domain (FS-domain) iff it is a Lawson compact B-poset (FS-poset); (3) The directed completions of B-posets (FS-posets) are B-domains (FS-domains); (4) The category B-POS (FS-POS) of B-posets (FS-posets) and Scott continuous maps is cartesian closed and has the category B-DOM (FS-DOM) of B-domains (FS-domains) and Scott continuous maps as a full reflective subcategory.     

Adjacency posets of planar graphs

In this paper, we show that the dimension of the adjacency poset of a planar graph is at most 8. From below, we show that there is a planar graph whose adjacency poset has dimension 5. We then show that the dimension of the adjacency poset of an outerplanar graph is at most 5. From below, we show that there is an outerplanar graph whose adjacency poset has dimension 4. We also show that the dimension of the adjacency poset of a planar bipartite graph is at most 4. This result is best possible. More generally, the dimension of the adjacency poset of a graph is bounded as a function of its genus and so is the dimension of the vertex-face poset of such a graph.     

Poset Loops

Given a ring and a locally finite poset, an incidence loop or poset loop is obtained from a new and natural extended convolution product on the set of functions mapping intervals of the poset to elements of the ring. The paper investigates the interplay between properties of the ring, the poset, and the loop. The annihilation structure of the ring and extremal elements of the poset determine commutative and associative properties for loop elements. Nilpotence of the ring and height restrictions on the poset force the loop to become associative, or even commutative. Constraints on the appearance of nilpotent groups of class 2 as poset loops are given. The main result shows that the incidence loop of a poset of finite height is nilpotent, of nilpotence class bounded in terms of the height of the poset.     

Poset extensions, convex sets, and semilattice presentations

The paper is devoted to an algebraic and geometric study of the feasible set of a poset, the set of finite probability distributions on the elements of the poset whose weights satisfy the order relationships specified by the poset. For a general poset, this feasible set is a barycentric algebra. The feasible sets of the order structures on a given finite set are precisely the convex unions of the primary simplices, the facets of the first barycentric subdivision of the simplex spanned by the elements of the set. As another fragment of a potential complete duality theory for barycentric algebras, a duality is established between order-preserving mappings and embeddings of feasible sets. In particular, the primary simplices constituting the feasible set of a given finite poset are the feasible sets of the linear extensions of the poset. A finite poset is connected if and only if its barycentre is an extreme point of its feasible set. The feasible set of a (general) disconnected poset is the join of the feasible sets of its components. The extreme points of the feasible set of a finite poset are specified in terms of the disjointly irreducible elements of the semilattice presented by the poset. Semilattices presented by posets are characterised in terms of various distributivity concepts.     

The dimension of planar posets

A partially ordered set (poset) is planar if it has a planar Hasse diagram. The dimension of a bounded planar poset is at most two. We show that the dimension of a planar poset having a greatest lower bound is at most three. We also construct four-dimensional planar posets, but no planar poset with dimension larger than four is known. A poset is called a tree if its Hasse diagram is a tree in the graph-theoretic sense. We show that the dimension of a tree is at most three and give a forbidden subposet characterization of two-dimensional trees.