Substitution and atomic extension on greedy posets (Q1104347)

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\).