The fixed point property in ordered sets of width two
The authors study the fixed point property in partially ordered sets of width two (every antichain contains at most two elements). Four-crown towers and belfries are defined, where a four-crown tower is a lexicographic sum of two-element antichains over a well-ordered index- set, and a belfry is - loosely speaking - a four-crown tower with a top to it. Theorem 1. Let P be an ordered set of width two. (1.1) If P has the fixed point property, then it contains a belfry (in P). (1.2) If P is chain- complete, then the following statements are equivalent: (a) P has the fixed point property, (b) P contains a belfry (in P), (c) no four-crown tower in P is a retract of P, (d) P is dismantlable. - Theorem 2. Let P be an ordered set of width two. If P or Q is chain-complete (Q is a poset of arbitrary width), and both P and Q have the fixed point property, then \(P\times Q\) has the fixed point property.
- Fixed points of products and the strong fixed point property
- Fixed point property and formal concept analysis
- Algorithms for the fixed point property
- Dimension two, fixed points and dismantlable ordered sets
- Fixed points and products: Width 3
- Retractability and the fixed point property for products
- The fixed point property for ordered sets
- Fixed point property for finite ordered sets that contain no crowns with 6 or more elements
- The fixed point property for ordered sets of interval dimension 2
- Minimal automorphic superpositions of crowns
- Forbidden retracts for finite ordered sets of width at most four
This page was built for publication: The fixed point property in ordered sets of width two
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1095161)
