Results 31 to 40 of about 45,393 (304)
𝓜𝓝-convergence and lim-inf𝓜-convergence in partially ordered sets
In this paper, we first introduce the notion of 𝓜𝓝-convergence in posets as an unified form of O-convergence and O2-convergence. Then, by studying the fundamental properties of 𝓜𝓝-topology which is determined by 𝓜𝓝-convergence according to the standard ...
Sun Tao, Li Qingguo, Fan Nianbai
doaj +1 more source
Partially ordered sets having selfdual system of intervals [PDF]
summary:In the present paper we deal with the existence of large homogeneous partially ordered sets having the property described in the ...
Jakubík, Ján
core +1 more source
Partially homogeneous partially ordered sets
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dan Saracino, Carol Wood
openaire +1 more source
summary:Some modifications of the definition of density of subsets in ordered (= partially ordered) sets are given and the corresponding concepts are ...
Vránová, Lidmila +3 more
core +1 more source
Using the fixed point theorem in partially ordered sets, we obtain sufficient conditions for the existence of a unique positive solution to a boundary-value problem of the Sturm-Liouville type for a nonlinear ordinary differential equation, and give an ...
G. E. Abduragimov +2 more
doaj +1 more source
The representations of posets (partially ordered sets), introduced by L. A. Nazarova and A. V. Roiter in 1972, play an important role in the modern representation theory and its applications. M. M.
В. М. Бондаренко +1 more
doaj +1 more source
Majorization on a Partially Ordered Set [PDF]
We extend the classical concept of set majorization to the case where the set is partially ordered. We give a useful property which characterizes majorization on a partially ordered set. Quite unexpectedly, the proof of this property relies on a theorem of Shapley on convex games.
openaire +1 more source
Choice Overload and Height Ranking of Menus in Partially-Ordered Sets
When agents face incomplete information and their knowledge about the objects of choice is vague and imprecise, they tend to consider fewer choices and to process a smaller portion of the available information regarding their choices.
Marcello Basili, Stefano Vannucci
doaj +1 more source
Between quantum logic and concurrency [PDF]
We start from two closure operators defined on the elements of a special kind of partially ordered sets, called causal nets. Causal nets are used to model histories of concurrent processes, recording occurrences of local states and of events. If every
Luca Bernardinello +2 more
doaj +1 more source
Distances between partially ordered sets [PDF]
summary:A distance between finite partially ordered sets is studied.
Zelinka, Bohdan
core +1 more source

