Authors: Erné, Marcel
Šešelja, Branimir
Tepavčević, Andreja 
Title: Posets Generated by Irreducible Elements
Journal: Order: A Journal on the Theory of Ordered Sets and its Applications
Volume: 20
Issue: 1
First page: 79
Last page: 89
Issue Date: 1-Jan-2003
Rank: M23
ISSN: 0167-8094
DOI: 10.1023/A:1024438130716
Let J be a fixed partially ordered set (poset). Among all posets in which J is joindense and consists of all completely join-irreducible elements, there is an up to isomorphism unique greatest one, the Alexandroff completion L. Moreover, the class of all such posets has a canonical set of representatives, C0L, consisting of those sets between J and L which intersect each of the intervals Ij = [jv, jv] (j ε J), where jv and jv denote the greatest element of L less than, respectively, not greater than j. The complete lattices in C0L form a closure system C∞L, consisting of all Dedekind-MacNeille completions of posets in C0L. We describe explicitly those L for which C0L, respectively, C∞L is a (complete atomic) Boolean lattice, and similarly, those for which C ∞L is distributive (or modular). Analogous results are obtained for CκL, the closure system of all posets in C 0L that are closed under meets of less than κ elements (where κ is any cardinal number).
Keywords: (completely) irreducible | Complete lattice | Completion | Join-dense | Poset
Publisher: Springer Link

Show full item record


checked on May 23, 2024

Page view(s)

checked on May 9, 2024

Google ScholarTM




Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.