Photo from wikipedia
We prove that, for a finite ordered set P that contains no crowns with 6 or more elements, it can be determined in polynomial time if P has the fixed… Click to show full abstract
We prove that, for a finite ordered set P that contains no crowns with 6 or more elements, it can be determined in polynomial time if P has the fixed point property. This result is obtained by proving that every such ordered set must contain a point of rank 1 that has a unique lower cover or a retractable minimal element.
Keywords:
finite ordered;
point property;
point;
crowns elements;
fixed point
Journal Title: Order
Year Published: 2020
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Order
Year Published: 2020
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!