The fixed point property for ordered sets of interval dimension 2 (Q2407685): Difference between revisions

In this paper, the author provides a polynomial time algorithm that determines if a given finite ordered set of interval dimension 2 has the fixed-point property. The following results are proved. For any ordered set \(P\), \(\mathrm{D2CCcheck}_{P} (P_1, \ldots, P_n)\) terminates in at most \(13|P|^5\) steps. Let \(P\) be a finite ordered set. Then the following holds. 1. \(P\) is d2-connectedly collapsible iff \(E(\mathcal{D}_{P} (P )) = \{\mathrm{TRUE}\}\). 2. \(P\) is d2-collapsible, but not d2-connectedly collapsible iff \(E(D_{P} (P )) = \{\mathrm{TRUE}, \mathrm{AC}\}\). 3. \(P\) is not d2-collapsible iff \(E(D_{P} (P )) \supseteq \{\mathrm{NO}\}\).