Reversible and bijectively related posets (Q2390976)

A poset is said to be reversible if every of its order-preserving self-bijections is an automorphism. Three classes of reversible posets are described: 1) Every poset \(P\) of height 2 that has finitely many connected components and contains finitely many crowns is reversible. 2) Let \(P\) be a well-founded poset such that every level \(P_{\alpha}\), \(\alpha< h(P)\), of \(P\) is finite. Then \(P\) is reversible. 3) A partially well-ordered set is hereditarily reversible. Also a sufficient condition for an order-preserving bijection to be an isomorphism is presented. Two posets are called bijectively related if from each of the two posets there exists an order-preserving bijection to the other. Then, two examples of pairs of non-isomorphic, bijectively related posets are given; further an example of a non-reversible poset that is bijectively related onto itself.