Posets generated by irreducible elements
Let \(J\) be a poset and \(L\) the Alexandroff completion of \(J\). Let be \(C_0L= \{P: J\subseteq P\subseteq L\), \(J(P)= J\}\) where \(J(P)\) is the set of all \(\vee\)-irreducible elements of \(P\). The complete lattices in \(C_0L\) form a closure system \(C_\infty L\). The posets for which \(C_0L\) is a complete Boolean atomic lattice and posets for which \(C_\infty L\) is distributive (or modular) are described. Similar results for \(C_k L\), the closure system of all posets in \(C_0 L\) that are closed under meets of less than \(k\) elements (\(k\) a cardinal number), are obtained.
- Collection of finite lattices generated by a poset
- The lattice of strict completions of a finite poset.
- Congruences on lattices and lattice-valued functions
- A proof of Tarski's fixed point theorem by application of Galois connections
- Intervals in lattices of \(\kappa\)-meet-closed subsets
- On Crawley's completion of a partially ordered set.
- The lattice of strict completions of a poset
- scientific article; zbMATH DE number 5073478 (Why is no real title available?)
- A new view of relationship between atomic posets and complete (algebraic) lattices
- Prime, irreducible elements and coatoms in posets.
- Interleaving by parts: join decompositions of interleavings and join-assemblage of geodesics
- Combinatorial topological models for phylogenetic networks and the mergegram invariant
This page was built for publication: Posets generated by irreducible elements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1404382)
