Abstract | ||
---|---|---|
Partially ordered sets labeled with k labels (k-posets) and their homomorphisms are examined. We give a representation of directed graphs by k-posets; this provides a new proof of the universality of the homomorphism order of k-posets. This universal order is a distributive lattice. We investigate some other properties, namely the infinite distributivity,
the computation of infinite suprema and infima, and the complexity of certain decision problems involving the homomorphism
order of k-posets. Sublattices are also examined. |
Year | DOI | Venue |
---|---|---|
2011 | 10.1007/s11083-010-9169-x | Order |
Keywords | Field | DocType |
Partial order,Labeled poset,Homomorphism | Discrete mathematics,Combinatorics,Distributive lattice,Distributivity,Total order,Algebra homomorphism,Homomorphism,Induced homomorphism (fundamental group),Mathematics,Partially ordered set,Completeness (order theory) | Journal |
Volume | Issue | ISSN |
28 | 2 | 0167-8094 |
Citations | PageRank | References |
5 | 0.53 | 15 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Léonard Kwuida | 1 | 55 | 16.25 |
Erkko Lehtonen | 2 | 100 | 17.04 |