The strong fixed point property for small sets
From MaRDI portal
A partially ordered set \(P\) has the strong fixed-point property if \(P\) has the fixed-point property and if there is a monotone selection of fixed points of the order-preserving mappings from \(P\) to \(P\). The authors give an algorithm generating fixed points of the order-preserving mappings of all partially ordered sets containing 10 elements or less, which shows that every such ordered set actually has the strong fixed- point property.
Recommendations
Cites work
Cited in
(12)- Fixed points of products and the strong fixed point property
- Fixed point property and formal concept analysis
- The fixed point property for small sets
- Algorithms for the fixed point property
- Fixed point property for 11-element sets
- Cores and retracts
- From finite posets to chain complete posets having no infinite antichain
- Performance guarantees and applications for Xia's algorithm
- scientific article; zbMATH DE number 4106917 (Why is no real title available?)
- On the strong fixed point property
- The strong fixed point property for lexicographic sums
- Homotopies and the universal fixed point property
This page was built for publication: The strong fixed point property for small sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1182038)