Substitution and atomic extension on greedy posets
The author studies the operations of substitution and atomic extension on greedy posets. He considers only finite partially ordered sets (P,\(\leq)\). For the substitution operation he proves that, if \(P=(P_ 1,x,P_ 2)\) is a greedy poset, then \(P_ 1\) and \(P_ 2\) are greedy posets. The converse of this is false, even if the jump number \(s(P)=s(P_ 1)+s(P_ 2)\). For the atomic extension, \(P=(P_ 1,x,P_ 2)\) is a greedy poset if and only if \(P_ 1\) and \(P_ 2\) are greedy posets. He also proves that the class of greedy semi-partitive lattices is the smallest one containing \(M_ n\) (n\(\geq 2)\), \(B_ 3\) (where \(M_ k\) is the lattice of order \(k+2\) with exactly k elements which are atom and coatom, \(B_ k\) (k\(\geq 2)\) is Boolean lattice of order \(2^ k)\) and closed by atomic extension. Then he shows that, although the class \(C_ n\) of greedy posets with jump number n is finite, \(C_ n\) can be obtained from a subclass \(D_ n\) of finite cardinality. He constructs \(D_ n\) for \(n=1,2\).
- A decomposition theorem for partially ordered sets
- scientific article; zbMATH DE number 3906240 (Why is no real title available?)
- scientific article; zbMATH DE number 3641455 (Why is no real title available?)
- Minimizing Setups for Ordered Sets: A Linear Algebraic Approach
- N-free posets as generalizations of series-parallel posets
- On finding the jump number of a partial order by substitution decomposition
- On the size of jump-critical ordered sets
- Optimal Linear Extensions by Interchanging Chains
This page was built for publication: Substitution and atomic extension on greedy posets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1104347)
