Results 1 to 10 of about 41,650 (141)
Continuity in Partially Ordered Sets [PDF]
The notion of a continuous domain is generalized to include posets which are not dcpos and in which the set of elements way below an element is not necessarily directed. We show that several of the pleasing algebraic and topological properties of domains
Venu G. Menon
doaj +2 more sources
Model selection over partially ordered sets. [PDF]
In problems such as variable selection and graph estimation, models are characterized by Boolean logical structure such as the presence or absence of a variable or an edge. Consequently, false-positive error or false-negative error can be specified as the number of variables/edges that are incorrectly included or excluded in an estimated model. However,
Taeb A, Bühlmann P, Chandrasekaran V.
europepmc +6 more sources
The Fuzzy Prime Spectrum of Partially Ordered Sets
We study the space of prime fuzzy ideals (and the space of maximal fuzzy ideals as a subspace) equipped with the hull-kernel topology in partially ordered sets.
Derso Abeje Engidaw +5 more
doaj +1 more source
An Efficient Algorithm for Decomposition of Partially Ordered Sets
Efficient time complexities for partial ordered sets or posets are well-researched field. Hopcroft and Karp introduced an algorithm that solves the minimal chain decomposition in O (n2.5) time. Felsner et al.
Elsayed Badr +3 more
doaj +1 more source
An Integer Linear Programming Model for Partially Ordered Sets
Linear programming is an important approach that is used to represent a large class of combinatorial optimization problems. The simplex algorithm is one of the algorithms for solving linear programming problems with exponential time complexity ...
Elsayed Badr +3 more
doaj +1 more source
A Notion of Convergence in Fuzzy Partially Ordered Sets
The notion of sequential convergence in fuzzy partially ordered sets, under the name oF-convergence, is well known. Our aim in this paper is to introduce and study a notion of net convergence, with respect to the fuzzy order relation, named o-convergence,
Dimitrios Georgiou +2 more
doaj +1 more source
Orthomodular Lattices Induced by the Concurrency Relation [PDF]
We apply to locally finite partially ordered sets a construction which associates a complete lattice to a given poset; the elements of the lattice are the closed subsets of a closure operator, defined starting from the concurrency relation. We show that,
Luca Bernardinello +2 more
doaj +1 more source
On the cardinality of layers in some partially ordered sets
In this paper, we explicitly calculated additional terms of cardinality asymptotics of layers in the n-dimensional k-valued lattice Enk for odd k as n → ∞. The main term had been previously determined by V.B.
T.V. Andreeva, Yu.S. Semenov
doaj +1 more source
Some Common Fixed Point Theorems in Partially Ordered Sets
The purpose of this paper is to prove some new fixed point theorem and common fixed point theorems of a commuting family of order-preserving mappings defined on an ordered set, which unify and generalize some relevant fixed point theorems.
Khadija Bouzkoura, Said Benkaddour
doaj +1 more source
Representations of bornologies
Bornologies abstract the properties of bounded sets of a metric space. But there are unbounded bornologies on a metric space like $\mathcal{P}(\RR)$ with the Euclidean metric.
Homeira Pajoohesh
doaj +1 more source

