Results 11 to 20 of about 45,393 (304)
Continuity in Partially Ordered Sets [PDF]
International Journal of Mathematics and Mathematical Sciences, 2008 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
A Notion of Convergence in Fuzzy Partially Ordered Sets
Mathematics, 2020 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 +2 more sources
Graphical partially ordered sets
Discrete Applied Mathematics, 1987 The main results of this paper can be found in a generalization of reconstruction properties to a large class of combinatorial structures by a concept of g-graph. For example in the section 3, the author shows many results about the reconstruction conjecture: many of them are known for graphs, but author's proof generalizes them for digraphs ...
Borzacchini, L.
openaire +3 more sources
Ramsey Numbers for Partially-Ordered Sets [PDF]
Order, 2018 We present a refinement of Ramsey numbers by considering graphs with a partial ordering on their vertices. This is a natural extension of the ordered Ramsey numbers. We formalize situations in which we can use arbitrary families of partially-ordered sets to form host graphs for Ramsey problems. We explore connections to well studied Turán-type problems
Christopher Cox, Derrick Stolee
exaly +3 more sources
Shaprly transitive partially ordered sets
Discrete Mathematics, 1986 If \(\Lambda\) is a p.o. set, \(A=Aut(\Lambda,\leq)\) will denote its group of automorphisms. If for each \(\lambda_ 1,\lambda_ 2\in \Lambda\) there is a unique \(a\in A\) such that \(\lambda_ 1a=\lambda_ 2\), we say that \(\Lambda\) is sharply transitive. It is easily seen that any sharply transitive p.o. set is connected or has just 2 elements.
Behrendt, Gerhard
openaire +2 more sources
The Fuzzy Prime Spectrum of Partially Ordered Sets
International Journal of Mathematics and Mathematical Sciences, 2023 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
Journal of Mathematics, 2023 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
Journal of Mathematics, 2022 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
On the cardinality of layers in some partially ordered sets
Учёные записки Казанского университета: Серия Физико-математические науки, 2020 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
Orthomodular Lattices Induced by the Concurrency Relation [PDF]
Electronic Proceedings in Theoretical Computer Science, 2009 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