Reducibility in Finite Posets
A notion of reducibility in finite posets is studied. Deletable elements in upper semimodular posets are characterized. Though it is known that the class of upper semimodular lattices is reducible, we construct an example of an upper semimodular poset that is not reducible. Reducibility of pseudocom...
Gespeichert in:
| Veröffentlicht in: | European journal of combinatorics 2001-02, Vol.22 (2), p.197-206 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | A notion of reducibility in finite posets is studied. Deletable elements in upper semimodular posets are characterized. Though it is known that the class of upper semimodular lattices is reducible, we construct an example of an upper semimodular poset that is not reducible. Reducibility of pseudocomplemented posets is studied. |
|---|---|
| ISSN: | 0195-6698 1095-9971 |
| DOI: | 10.1006/eujc.2000.0432 |