Reversible and bijectively related posets (Q2390976): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s11083-009-9111-2 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1967576605 / rank | |||
Normal rank |
Revision as of 15:19, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Reversible and bijectively related posets |
scientific article |
Statements
Reversible and bijectively related posets (English)
0 references
10 August 2009
0 references
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.
0 references
order-preserving bijection
0 references
order isomorphism
0 references
reversible poset
0 references
bijectively related posets
0 references