Reducibility in finite posets
From MaRDI portal
Let \(P\) be a poset belonging to a class of finite posets with \(0\). An element \(x\in P\) is called deletable if \(P\setminus\{x\}\) belongs to the same class as \(P\). A class of posets is reducible if each poset of this class has a deletable element. The authors characterize elements deletable in upper semimodular posets and prove that the class of upper semimodular posets is not reducible. Further, they solve an analogous problem for the class of pseudocomplemented posets.
Recommendations
Cites work
- Height on posets and graphs
- scientific article; zbMATH DE number 3598539 (Why is no real title available?)
- scientific article; zbMATH DE number 3204690 (Why is no real title available?)
- Lattices with Doubly Irreducible Elements
- Les treillis pseudocomplémentés finis. (The finite pseudocomplemented lattices)
- Pseudo-Complements in Posets
- Reducible classes of finite lattices
Cited in
(10)- Reducible classes of finite lattices
- Positive presentations of families in relation to reducibility with respect to enumerability
- On multiple positive reducibility
- Residuation in finite posets
- Combinatorics of reductions between equivalence relations
- Reducibility number
- scientific article; zbMATH DE number 3851045 (Why is no real title available?)
- Repetition in reduced decompositions
- scientific article; zbMATH DE number 2152232 (Why is no real title available?)
- Reducibility of hyperplane arrangements
This page was built for publication: Reducibility in finite posets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5927686)
