نتایج جستجو برای: directed complete partially ordered set

تعداد نتایج: 1263669  

2003
Michel Habib David Kelly Emmanuelle Lebhar Christophe Paul

A graph Gs = (V,Es) is a sandwich for a pair of graph Gt = (V,Et) and G = (V,E) if Et ⊆ Es ⊆ E. Any poset, or partially ordered set, admits a unique graph representation which is directed and transitive. In this paper we introduce the notion of sandwich poset problems inspired by former sandwich problems on comparability graphs. In particular, we are interested in seriesparallel and interval po...

Journal: :iranian journal of fuzzy systems 2015
s. m. vaezpour s. vaezzadeh

in this paper, a concept of generalized weakly contraction mappings in partially ordered fuzzy metric spaces is introduced and  coincidence point  theorems on partially ordered fuzzy metric spaces are proved. also, as the corollary of these theorems, some common fixed point theorems on partially ordered fuzzy metric spaces are presented.

A. Jabbari M. Eshaghi S. Mohseni

In this paper, we introduce tripled partially ordered sets and monotone functions on tripled partiallyordered sets. Some basic properties on these new dened sets are studied and some examples forclarifying are given.

In this paper, we have focused to study convex $L$-subgroups of an $L$-ordered group. First, we introduce the concept of a convex $L$-subgroup and a convex $L$-lattice subgroup of an $L$-ordered group and give some examples. Then we find some properties and use them to construct convex $L$-subgroup generated by a subset $S$ of an $L$-ordered group $G$ . Also, we generalize a well known result a...

Journal: :Journal of Combinatorial Theory, Series B 1980

2008
Peter Chen Guoli Ding Steve Seiden

We consider the follow poset merging problem: Let X and Y be two subsets of a partially ordered set S. Given complete information about the ordering within both X and Y , how many comparisons are needed to determine the order on X ∪ Y ? This problem is a natural generalization of the list merging problem. While searching in partially ordered sets and sorting partially ordered sets have been con...

2000
Roman R. Zapatrin

For an arbitrary partially ordered set P its dual P ∗ is built as the collection of all monotone mappings P → 2 where 2 = {0, 1} with 0 < 1. The set of mappings P ∗ is proved to be a complete lattice with respect to the pointwise partial order. The second dual P ∗∗ is built as the collection of all morphisms of complete lattices P ∗ → 2 preserving universal bounds. Then it is proved that the pa...

We present some fixed point results for a single mapping and a pair of compatible mappings via auxiliary functions which satisfy a generalized weakly contractive condition in partially ordered complete $G$-metric spaces. Some examples are furnished to illustrate the useability of our main results. At the end, an application is presented to the study of exi...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید