Labeled posets are universal (Q2472843): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Free shuffle algebras in language varieties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4530231 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equational theory of pomsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3922196 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On universal partly ordered sets and classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal partial order represented by means of oriented trees and other simple graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite paths are universal / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-partitions over posets with an application to reducing the set of solutions of NP problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501530 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical Approaches to Computational Barriers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theories of orders on the set of words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Descending chains and antichains of the unary, linear, and monotone subfunction relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling concurrency with partial orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebra and theory of order-deterministic pomsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4664632 / rank
 
Normal rank

Latest revision as of 17:48, 27 June 2024

scientific article
Language Label Description Also known as
English
Labeled posets are universal
scientific article

    Statements

    Labeled posets are universal (English)
    0 references
    0 references
    25 February 2008
    0 references
    The main goal of this paper is to study partially ordered sets labeled with \( k\) labels (\(k\)-posets) and their homomorphisms. Section 2 deals with some preliminary results on these notions. In Section 3 it is proved that the homomorphicity order of finite \(k\)-posets is a distributive lattice. In Section 4 it is shown that the homomorphicity orders of finite \(k\)-posets and \(k\)-lattices are universal, in the sense that every countable poset can be embedded into them. Section 5 deals with representations of \(k\)-posets by directed graphs. An interesting categorical isomorphism between \(k\)-posets and their digraph representations is established.
    0 references
    0 references
    partially ordered sets with \( k\) labels
    0 references
    representations of \(k\)-posets by directed graphs
    0 references
    0 references